A Convex Optimization Approach to Multi-Robot Task Allocation and Path Planning
Author:
Lei Tingjun1ORCID, Chintam Pradeep1ORCID, Luo Chaomin1ORCID, Liu Lantao2ORCID, Jan Gene Eu34ORCID
Affiliation:
1. Department of Electrical and Computer Engineering, Mississippi State University, Mississippi State, MS 39762, USA 2. Department of Intelligent Systems Engineering, Indiana University, Bloomington, IN 47408, USA 3. Department of Electrical Engineering, National Taipei University, New Taipei City 23741, Taiwan 4. Tainan National University of the Arts, Tainan City 72045, Taiwan
Abstract
In real-world applications, multiple robots need to be dynamically deployed to their appropriate locations as teams while the distance cost between robots and goals is minimized, which is known to be an NP-hard problem. In this paper, a new framework of team-based multi-robot task allocation and path planning is developed for robot exploration missions through a convex optimization-based distance optimal model. A new distance optimal model is proposed to minimize the traveled distance between robots and their goals. The proposed framework fuses task decomposition, allocation, local sub-task allocation, and path planning. To begin, multiple robots are firstly divided and clustered into a variety of teams considering interrelation and dependencies of robots, and task decomposition. Secondly, the teams with various arbitrary shape enclosing intercorrelative robots are approximated and relaxed into circles, which are mathematically formulated to convex optimization problems to minimize the distance between teams, as well as between a robot and their goals. Once the robot teams are deployed into their appropriate locations, the robot locations are further refined by a graph-based Delaunay triangulation method. Thirdly, in the team, a self-organizing map-based neural network (SOMNN) paradigm is developed to complete the dynamical sub-task allocation and path planning, in which the robots are dynamically assigned to their nearby goals locally. Simulation and comparison studies demonstrate the proposed hybrid multi-robot task allocation and path planning framework is effective and efficient.
Funder
Mississippi Space Grant Consortium
Subject
Electrical and Electronic Engineering,Biochemistry,Instrumentation,Atomic and Molecular Physics, and Optics,Analytical Chemistry
Reference51 articles.
1. Liu, L., Luo, C., and Shen, F. (2017, January 18–20). Multi-agent formation control with target tracking and navigation. Proceedings of the 2017 IEEE International Conference on Information and Automation (ICIA), Macao, China. 2. Jiménez, A.C., García-Díaz, V., and Bolaños, S. (2018). A decentralized framework for multi-agent robotic systems. Sensors, 18. 3. Patil, A., Bae, J., and Park, M. (2022). An algorithm for task allocation and planning for a heterogeneous multi-robot system to minimize the last task completion time. Sensors, 22. 4. Zhang, Q., Luo, R., Zhao, D., Luo, C., and Qian, D. (2019, January 14–19). Model-free reinforcement learning based lateral control for lane keeping. Proceedings of the 2019 International Joint Conference on Neural Networks (IJCNN), Budapest, Hungary. 5. Wang, J., and Luo, C. (2019, January 17–19). Automatic wall defect detection using an autonomous robot: A focus on data collection. Proceedings of the ASCE International Conference on Computing in Civil Engineering 2019: Data, Sensing, and Analytics, Atlanta, GA, USA.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
|
|