Che Ku, Nor Azie Hailma and Omar, Rosli and Sabudin Elia Nadira, Sabudin Elia Nadira (2016) Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming. ARPN Journal of Engineering and Applied Sciences, 11 (14). pp. 8921-8926. ISSN 1819-6608
Text
AJ 2016 (26).pdf Restricted to Registered users only Download (254kB) | Request a copy |
Abstract
Path planning is one of the issues to be handled in the development of autonomous systems. For a group of agents, cooperative path planning is crucial to ensure that a given mission is accomplished in the shortest time possible with optimal solution. Optimal means that the resulting path has minimal length hence the total consumed energy by the agents is the least. Cooperative path planning fuses information from all agents to plan an optimal path. There are a number of cooperative path planning methods available in the literature for multi-agent including Cell Decomposition, Roadmap and Potential Field to name but three. This paper will review and compare the performances of those existing methods that can find solution without graph search algorithm such as Mixed-Integer Linear Programming (MILP) techniques which exactly solves the problem and then propose four alternative MILP formulations which are computationally less intensive and suited for real-time purposes, but yield a theoretically guaranteed suboptimal solution.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | path planning; mixed-Integer linear programming |
Subjects: | T Technology > TJ Mechanical engineering and machinery > TJ210.2-211.47 Mechanical devices and figures. Automata. Ingenious mechanisms. Robots (General) |
Divisions: | Faculty of Electrical and Electronic Engineering > Department of Electrical Engineering |
Depositing User: | Mrs. Mashairani Ismail |
Date Deposited: | 01 Dec 2021 07:09 |
Last Modified: | 01 Dec 2021 07:09 |
URI: | http://eprints.uthm.edu.my/id/eprint/4235 |
Actions (login required)
View Item |