Home /Research /Homotopic Approach for Robot Allocation Optimization Coupled With Path Constraints
SWARM

Homotopic Approach for Robot Allocation Optimization Coupled With Path Constraints

Weiran Yao, Naiming Qi, Yongbei Liu, Song Xu, Desong Du

Year
2019
Citations
9

Abstract

This letter investigates a special task allocation problem with constraints of path planning. The path planning process involved is defined as the follow-up step of task allocation. The allocation problem is coupled with path constraints, which will affect the utility of allocation solution. A homotopic approach featuring two homotopy primitives is proposed to resolve the complexity caused by the coupling between task allocation and path planning. Reference paths generated by the homotopic approach are transformed to desired task bundles for robots via transformation functions. A distributed task allocation architecture with market mechanism is employed to make consensus on task allocation solution in multi-robot. Simulation results validate the performance of the proposed methods comparing with conventional allocation methods.

Keywords

Path (computing)Task (project management)Computer scienceMathematical optimizationMotion planningRobotProcess (computing)Transformation (genetics)Distributed computingHomotopy

Related papers

Browse all SWARM papers