PLANNING FOR THE CONVOY MOVEMENT PROBLEM

Anand Kumar, I. Murugeswari, Deepak Khemani, N. S. Narayanaswamy

2012

Abstract

Convoy movement problem has significant practical applications. The problem has been attempted in many styles with varying results. We address it as an AI Search and Planning and Scheduling problem. The work focuses on modeling the convoy movement problem using PDDL and attempting a solution using existing planning methods and planners. Initial results indicated problems of scalability. To address this we propose a two stage planning process.

Paper Citation

in Harvard Style

Kumar A., Murugeswari I., Khemani D. and S. Narayanaswamy N. (2012). PLANNING FOR THE CONVOY MOVEMENT PROBLEM . In Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8425-95-9, pages 495-498. DOI: 10.5220/0003739004950498

in Bibtex Style

@conference{icaart12,
author={Anand Kumar and I. Murugeswari and Deepak Khemani and N. S. Narayanaswamy},
title={PLANNING FOR THE CONVOY MOVEMENT PROBLEM},
booktitle={Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2012},
pages={495-498},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003739004950498},
isbn={978-989-8425-95-9},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - PLANNING FOR THE CONVOY MOVEMENT PROBLEM
SN - 978-989-8425-95-9
AU - Kumar A.
AU - Murugeswari I.
AU - Khemani D.
AU - S. Narayanaswamy N.
PY - 2012
SP - 495
EP - 498
DO - 10.5220/0003739004950498