Coordinated dynamic mission planning scheme for intelligent multi-agent systems
来源期刊:中南大学学报(英文版)2012年第11期
论文作者:PENG Jun(彭军) WEN Meng-fei(文孟飞) XIE Guo-qi(谢国祺) ZHANG Xiao-yong(张晓勇) Kuo-chi LIN
文章页码:3170 - 3179
Key words:weighted AND/OR tree; multiple intelligent agent; coordinated dynamic mission planning; AOE-Network
Abstract: Mission planning was thoroughly studied in the areas of multiple intelligent agent systems, such as multiple unmanned air vehicles, and multiple processor systems. However, it still faces challenges due to the system complexity, the execution order constraints, and the dynamic environment uncertainty. To address it, a coordinated dynamic mission planning scheme is proposed utilizing the method of the weighted AND/OR tree and the AOE-Network. In the scheme, the mission is decomposed into a time-constraint weighted AND/OR tree, which is converted into an AOE-Network for mission planning. Then, a dynamic planning algorithm is designed which uses task subcontracting and dynamic re-decomposition to coordinate conflicts. The scheme can reduce the task complexity and its execution time by implementing real-time dynamic re-planning. The simulation proves the effectiveness of this approach.
PENG Jun(彭军)1,2,WEN Meng-fei(文孟飞)1,2, XIE Guo-qi(谢国祺)3, ZHANG Xiao-yong(张晓勇)1,2, Kuo-chi LIN4
(1. School of Information Science and Engineering, Central South University, Changsha 410075, China;
2. Hunan Engineering Laboratory for Advanced Control and Intelligent Automation
(Central South University), Changsha 410075, China;
3. Embedded Systems and Networking Laboratory,
Hunan Provincial Key Laboratory of Network and Information Security
(Hunan University), Changsha 410075, China;
4. Department of Mechanical and Aerospace Engineering, University of Central Florida, Orlando, FL 32816, USA)
Abstract:Mission planning was thoroughly studied in the areas of multiple intelligent agent systems, such as multiple unmanned air vehicles, and multiple processor systems. However, it still faces challenges due to the system complexity, the execution order constraints, and the dynamic environment uncertainty. To address it, a coordinated dynamic mission planning scheme is proposed utilizing the method of the weighted AND/OR tree and the AOE-Network. In the scheme, the mission is decomposed into a time-constraint weighted AND/OR tree, which is converted into an AOE-Network for mission planning. Then, a dynamic planning algorithm is designed which uses task subcontracting and dynamic re-decomposition to coordinate conflicts. The scheme can reduce the task complexity and its execution time by implementing real-time dynamic re-planning. The simulation proves the effectiveness of this approach.
Key words:weighted AND/OR tree; multiple intelligent agent; coordinated dynamic mission planning; AOE-Network