scholarly journals A Hierarchical Mission Planning Method for Simultaneous Arrival of Multi-UAV Coalition

2019 ◽  
Vol 9 (10) ◽  
pp. 1986 ◽  
Author(s):  
Fei Yan ◽  
Xiaoping Zhu ◽  
Zhou Zhou ◽  
Jing Chu
Keyword(s):  
Task Allocation ◽  
Planning Method ◽  
Mission Planning ◽  
Second Phase ◽  
Planning Problem ◽  
Resource Requirement ◽  
Allocation Algorithm ◽  
Estimation Process ◽  
Allocation Process ◽  
Ph Curve

A hierarchical mission planning method was proposed to solve a simultaneous attack mission planning problem for multi-unmanned aerial vehicles (UAVs). The method consisted of three phases aiming to decouple and solve the mission planning problem. In the first phase, the Pythagorean hodograph (PH) curve was used in the path estimation process for each UAV, which also served as the input for the task allocation process. In the second phase, a task allocation algorithm based on a negotiation mechanism was proposed to assign the targets. Considering the resource requirement, time-dependent value of targets and resource consumption of UAVs, the proposed task allocation algorithm can generate a feasible allocation strategy and get the maximum system utility. In the last phase, a path planning method was proposed to generate a simultaneous arrival PH path for each UAV considering UAV’s kinematic constraint and collision avoidance with obstacles. The comparison simulations showed that the path estimation process using the PH curve and the proposed task allocation algorithm improved the system utility, and the hierarchical mission planning method has potential in a real mission.

scholarly journals UAV Swarm Mission Planning in Dynamic Environment Using Consensus-Based Bundle Algorithm

Sensors ◽  
2020 ◽  
Vol 20 (8) ◽  
pp. 2307 ◽  
Author(s):  
Yaozhong Zhang ◽  
Wencheng Feng ◽  
Guoqing Shi ◽  
Frank Jiang ◽  
Morshed Chowdhury ◽  
...  
Keyword(s):  
Real Time ◽  
Task Allocation ◽  
Dynamic Environment ◽  
Mission Planning ◽  
Planning Problem ◽  
Allocation Mechanism ◽  
The Real ◽  
Dynamic Task ◽  
Time Performance ◽  
Communication Time

To solve the real-time complex mission-planning problem for Multiple heterogeneous Unmanned Aerial Vehicles (UAVs) in the dynamic environments, this paper addresses a new approach by effectively adapting the Consensus-Based Bundle Algorithms (CBBA) under the constraints of task timing, limited UAV resources, diverse types of tasks, dynamic addition of tasks, and real-time requirements. We introduce the dynamic task generation mechanism, which satisfied the task timing constraints. The tasks that require the cooperation of multiple UAVs are simplified into multiple sub-tasks to perform by a single UAV independently. We also introduce the asynchronous task allocation mechanism. This mechanism reduces the computational complexity of the algorithm and the communication time between UAVs. The partial task redistribution mechanism has been adopted for achieving the dynamic task allocation. The real-time performance of the algorithm is assured on the premise of optimal results. The feasibility and real-time performance of the algorithm are validated by conducting dynamic simulation experiments.

Research of Multiple UAVs Task Allocation Based on Improved Contract Net

2013 ◽  
Vol 823 ◽  
pp. 439-444 ◽  
Author(s):  
Ya Wei Li ◽  
Bao An Li
Keyword(s):  
Task Allocation ◽  
Load Factor ◽  
Allocation Algorithm ◽  
Task Load ◽  
Contract Net ◽  
Multiple Uavs ◽  
Allocation Process ◽  
Control Target ◽  
Simulation Results ◽  
Improved Algorithm

This paper makes a research on multiple UAVs task allocation in cooperative combat. The control target is presented and the model is built of the problem. By introducing load factor, the traditional task allocation algorithm based on contract net is improved. With considering the mission capability of UAVs, a task allocation algorithm based on improved contract net is given. The improved algorithm can significantly reduce the communication between UAVs, and can optimize the task allocation process. The simulation results show that compared with the traditional task allocation algorithm based on contract net, the improved algorithm can improve the efficiency of UAVs task allocation and balance the task load between the UAVs, it can solve the problem of multiple types of tasks allocation effectively.

scholarly journals The best task allocation process is to decide on one’s own: effects of the allocation agent in human–robot interaction on perceived work characteristics and satisfaction

2020 ◽  
Author(s):  
Alina Tausch ◽  
Annette Kluge
Keyword(s):  
Task Allocation ◽  
New Technologies ◽  
Human Robot Interaction ◽  
Work Characteristics ◽  
Allocation Decision ◽  
Robot Interaction ◽  
Work Systems ◽  
Organizational Unit ◽  
Allocation Process ◽  
Task Identity

AbstractNew technologies are ever evolving and have the power to change human work for the better or the worse depending on the implementation. For human–robot interaction (HRI), it is decisive how humans and robots will share tasks and who will be in charge for decisions on task allocation. The aim of this online experiment was to examine the influence of different decision agents on the perception of a task allocation process in HRI. We assume that inclusion of the worker in the allocation will create more perceived work resources and will lead to more satisfaction with the allocation and the work results than a decision made by another agent. To test these hypotheses, we used a fictional production scenario where tasks were allocated to the participant and a robot. The allocation decision was either made by the robot, by an organizational unit, or by the participants themselves. We then looked for differences between those conditions. Our sample consisted of 151 people. In multiple ANOVAs, we could show that satisfaction with the allocation process, the solution, and with the result of the work process was higher in the condition where participants themselves were given agency in the allocation process compared to the other two. Those participants also experienced more task identity and autonomy. This has implications for the design of allocation processes: The inclusion of workers in task allocation can play a crucial role in leveraging the acceptance of HRI and in designing humane work systems in Industry 4.0.

scholarly journals Modeling and Simulation of Mission Planning Problem for Remote Sensing Satellite Imaging

2018 ◽  
Vol 179 ◽  
pp. 03024 ◽  
Author(s):  
Yao Pan ◽  
Zhong Ming Chi ◽  
Qi Long Rao ◽  
Kai Peng Sun ◽  
Yi Nan Liu
Keyword(s):  
Remote Sensing ◽  
Time Window ◽  
Constraint Satisfaction Problem ◽  
Optimal Path ◽  
Time Constraint ◽  
Mission Planning ◽  
Planning Problem ◽  
Satellite Imaging ◽  
Problem Model ◽  
Remote Sensing Satellite

Mission planning problem for remote sensing satellite imaging is studied. Firstly, the time constraint satisfaction problem model is presented after analyzing the characteristic of time constraint. Then, An optimal path searching algorithm based on the discrete time window is proposed according to the non-uniqueness for satellite to mission in the visible time window. Simulation results verify the efficiency of the model and algorithm.

Sign in / Sign up

Export Citation Format

Share Document