Conference Proceeding Article
In this paper, we discuss the problem of route planning and scheduling by a group of agents. Each agent is responsible for designing a route plan and schedule over a geographical network, and the goal is to obtain a conflict-free plan/schedule that optimizes a global objective. We present a hybrid conflict resolution method that involves coalition formation and distributed constraint satisfaction depending on the level of coupling between agents. We show how this approach can be effectively applied to solve a distributed convoy movement planning problem.
conflict resolution, coalition formation, distributed problem solving, logistics
Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology WI-IAT 2010: 31 August-3 September 2010, Toronto: Proceedings
IEEE Computer Society
City or Country
Los Alamitos, CA
THANGARAJOO, Ramesh and LAU, Hoong Chuin.
Distributed route planning and scheduling via hybrid conflict resolution. (2010). IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology WI-IAT 2010: 31 August-3 September 2010, Toronto: Proceedings. 374-378. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/1015
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.