Publication Type

Conference Proceeding Article

Publication Date

8-2010

Abstract

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.

Keywords

conflict resolution, coalition formation, distributed problem solving, logistics

Discipline

Artificial Intelligence and Robotics | Operations Research, Systems Engineering and Industrial Engineering

Research Areas

Intelligent Systems and Decision Analytics

Publication

IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology WI-IAT 2010: 31 August-3 September 2010, Toronto: Proceedings

First Page

374

Last Page

378

ISBN

9780769541914

Identifier

10.1109/WI-IAT.2010.257

Publisher

IEEE Computer Society

City or Country

Los Alamitos, CA

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://doi.ieeecomputersociety.org/10.1109/WI-IAT.2010.257

Share

COinS