计算机科学
群体行为
任务(项目管理)
数学优化
粒子群优化
职位(财务)
运动规划
分布式计算
弹道
分配问题
不相交集
机器人
运筹学
人工智能
算法
工程类
数学
系统工程
组合数学
天文
物理
经济
财务
作者
Inmo Jang,Hyo‐Sang Shin,Antonios Tsourdos,Junho Jeong,Seungkeun Kim,Jinyoung Suk
标识
DOI:10.1177/0954410018772622
摘要
Given a cooperative mission consisting of multiple tasks spatially distributed, an aerial robotic swarm’s decision-making issues include team formation, team-to-task assignment, agent-to-work-position assignment and trajectory optimisation with collision avoidance. The problem becomes even more complicated when involving heterogeneous agents, tasks’ minimum requirements and fair allocation. This paper formulates all the combined issues as an optimisation problem and then proposes an integrated framework that addresses the problem in a decentralised fashion. We approximate and decouple the complex original problem into three subproblems (i.e. coalition formation, position allocation and path planning), which are sequentially addressed by three different proposed modules. The coalition formation module based on game theories deals with a max-min problem, the objective of which is to partition the agents into disjoint task-specific teams in a way that balances the agents’ work resources in proportion to the task’s minimum workload requirements. For agents assigned to the same task, given reasonable assumptions, the position allocation subproblem can be efficiently addressed in terms of computational complexity. For the trajectory optimisation, we utilise a Model Predictive Control and Sequential Convex Programming algorithm, which reduces the size of the problem so that the agents can generate collision-free trajectories on a real-time basis. As a proof of concept, we implement the framework into an unmanned aerial vehicle swarm’s cooperative stand-in jamming mission scenario and show its feasibility, fault tolerance and near-optimality based on numerical experiment.
科研通智能强力驱动
Strongly Powered by AbleSci AI