This paper presents a three-layered approach for the mission route planning problems involving a team of autonomous vehicles where they have to collectively navigate to a number of target locations in an environment with both static and dynamic obstacles. The first layer computes the maximum distance that need to be traveled to complete a mission by a team of vehicles. We have developed a nearest-neighbor-search based approach to assign closely located tasks to each vehicle in the team. We developed a stochastic optimization based path planning algorithm that can compute the collision-free (with both static and dynamic obstacles) trajectory for a vehicle to navigate from start to the target location. By combining task assignment with path planning algorithm, we can estimate the maximum traveled distance for a mission with a team of vehicles. The second layer determines the optimal number of vehicles required for a mission based on any user defined constraint by casting it as a multiobjective optimization problem with two competing objectives, i.e. time vs cost. The methods derived in layer one are utilized to evaluate the objective functions in layer two. Finally, we have proposed a data driven neural network-based prediction model that will forecast the mission completion time with a reasonable accuracy which will utilize the historical information of the previous missions. The forecasting model is intended to facilitate the effective planning of parallel and subsequent missions. We have demonstrated the effectiveness of our approach with numerical simulation results for every layer mentioned above.
24 November 2023 in The Journal of Defense Modeling and Simulation: Applications, Methodology, Technology
A fundamental component of any military medical support system is medical evacuation. The main goal of evacuation is to reduce mortality among critically injured combat casualties. To achieve this goal, several decision problems including, the location of medical treatment facilities, relocation, dispatching, and routing have to be effective across all levels (tactical, operational, and strategic). This study concentrates on the three key types of medical evacuation (MEDEVAC) systems—forward, tactical, and strategic—and the related decision problems. Even though, over the last few years, some review papers have discussed the different topics of MEDEVAC systems (e.g., the evolution of MEDEVAC, evacuation timelines, and types of injuries), no research has been conducted on the full range (i.e., total care pathway) of MEDEVAC systems and the adoption of emerging technologies to improve future MEDEVAC. In this paper, a systematic review of the literature is described, including the decision problems involved in the total military medical evacuation process. This paper also reviews forecast challenges of future MEDEVAC and potential emerging technologies, concepts, and advanced decision-analysis methods to tackle these challenges. In future MEDEVAC processes, emerging technologies and concepts will be important to support improved medical capability; however, military planners will also need to adopt advanced decision-support techniques to efficiently employ these technologies.
Dealing with uncertainties along with high-efficiency planning for task assignment problem is still challenging, especially for multi-agent systems. In this paper, two frameworks—Compromise View model and the Nearest-Neighbour Search model—are analyzed and compared for co-operative path planning combined with task assignment of a multi-agent system in dynamic environments. Both frameworks are capable of dynamically controlling a number of autonomous agents to accomplish multiple tasks at different locations. Furthermore, these two models are capable of dealing with dynamically changing environments. In both approaches, the Particle Swarm Optimization-based method is applied for path planning. The path planning approach combined with the obstacle avoidance strategy is integrated with the task assignment problem. In one framework, the Compromise View model is used for completing the tasks and a combination of clustering method with the Nearest-Neighbour Search model is used to assign tasks to the other framework. The frameworks are compared in terms of computational time and the resulting path length. Results indicate that the Nearest-Neighbour Search model is much faster than the Compromise View model. However, the Nearest-Neighbour Search model generates longer paths to accomplish the mission. By following the Nearest-Neighbour Search approach, agents can successfully accomplish their mission, even under uncertainties such as malfunction of individual agents. The Nearest-Neighbour Search framework is highly effective due to its reactive structure. As per requirements, to save time, after completing its own tasks, one agent can complete the remaining tasks of other agents. The simulation results show that the Nearest-Neighbour Search model is an effective and robust way of solving co-operative path planning combined with task assignment problems.