Abstract
Mobile robots are extensively used to complete repetitive operations in industrial areas such as intelligent transportation, logistics, and manufacturing systems. This paper addresses the path planning problem of multi-type robot systems with time windows based on timed colored Petri nets. The tasks to be completed are divided into three different types: common, exclusive and collaborative. An analytical approach to plan a group of different types of mobile robots is developed to ensure that some specific robots will visit task regions within given time windows. First, a multi-type robot system and its environment are modeled by a timed colored Petri net. Then, some methods are developed to convert the task requirements that contain logic constraints and time windows into linear constraints. Based on integer linear programming techniques, a planning approach is proposed to minimize the total cost (i.e., total travel distance) of the system. Finally, simulation studies are investigated to show the effectiveness of the developed approach.
Funder
National Natural Science Foundation of China
China Postdoctoral Science Foundation
Subject
Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science
Reference48 articles.
1. Distributed collaboration with limited communication using mission state estimates;Godwin;Proceedings of the American Control Conference,2006
2. A Formal Analysis and Taxonomy of Task Allocation in Multi-Robot Systems
3. Multi-robot GSA- and PSO-based optimal path planning in static environments;Purcaru;Proceedings of the 9th International Workshop on Robot Motion and Control,2013
4. Multiple robot path coordination using artificial potential fields;Warren;Proceedings of the IEEE International Conference on Robotics and Automation,1990
5. AI buzzwords explained
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献