PLANNING FOR THE CONVOY MOVEMENT PROBLEM

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

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.

References

  1. Chardaire, P., McKeown, G. P., Verity-Harrison, S. A., and Richardson, S. B. (2005). Solving a time-space network formulation for the convoy movement problem. Operations Research, 53(2):219-230.
  2. Coles, A., Fox, M., Halsey, K., Long, D., and Smith, A. (2009). Managing concurrency in temporal planning using planner-scheduler interaction. Artificial Intelligence, 173(1):1 - 44.
  3. Do, M. B. and Kambhampati, S. (2003). Sapa: A multiobjective metric temporal planner. Journal of Artificial Intelligence Research, 20:155-194.
  4. Gerevini, A., Saetti, A., and Serina, I. (2006). An approach to temporal planning and scheduling in domains with predictable exogenous events. Journal of Artificial Intelligence Research (JAIR), 25:187-231.
  5. Gerevini, A. and Serina, I. (2002). Lpg: A planner based on local search for planning graphs with action costs. In International Conference on Automated Planning and Scheduling/Artificial Intelligence Planning Systems, pages 13-22.
  6. Goldstein, D., Shehab, T., Casse, J., and Lin, H.-C. (2010). On the formulation and solution of the convoy routing problem. Transportation Research Part E: Logistics and Transportation Review, 46(4):520 - 533. Selected papers from the Second National Urban Freight Conference, Long Beach, California, December 2007.
  7. Montana, D., Bidwell, G., Vidaver, G., and Herrero, J. (1999). Scheduling and route selection for military land moves using genetic algorithms. In Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on, volume 2, pages 3 vol. (xxxvii+2348).
Download


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