NEW REASONING FOR TIMELINE BASED PLANNING - An Introduction to J-TRE and its Features

Riccardo De Benedictis, Amedeo Cesta

Abstract

Time and resource reasoning are crucial aspects for modern planners to succeed in several real world domains. A quite natural way to deal with such reasoning is to use timeline based representations that have been exploited in several application-oriented planners. The search aspects of those planners still remain a “black art” for few experts of such particular approach. This paper proposes a new model to conduct search with timelines. It starts from the observation that current timeline based planners spend most search time in doing blind constraint reasoning and explores a different hybrid model to represent and reason on timelines that may overcome such computational burden.

References

  1. Allen, J. F. (1983). Maintaining Knowledge about Temporal Intervals. Commun. ACM, 26(11):832-843.
  2. Bedrax-Weiss, T., McGann, C., and Ramakrishnan, S. (2003). Formalizing Resources for Planning. In Proceedings of the Workshop on Planning Domain Description Language at ICAPS-03, pages 7-14.
  3. Bernardini, S. and Smith, D. (2007). Developing domainindependent search control for EUROPA2. In Proceedings of the Workshop on Heuristics for Domainindependent Planning at ICAPS-07.
  4. Cesta, A., Oddi, A., and Smith, S. F. (2002). A Constraintbased Method for Project Scheduling with Time Windows. Journal of Heuristics, 8(1):109-136.
  5. Dechter, R. (2003). Constraint Processing. Morgan Kaufmann.
  6. Di Rosa, E., Giunchiglia, E., and Maratea, M. (2010). Solving Satisfiability Problems with Preferences. Constraints, 15(4):485-515.
  7. Een, N. and Sorensson, N. (2003). An Extensible SATSolver. In Giunchiglia, E. and Tacchella, A., editors, SAT, volume 2919 of Lecture Notes in Computer Science, pages 502-518. Springer.
  8. Erol, K., Hendler, J., and Nau, D. S. (1994). HTN Planning: Complexity and Expressivity. In AAAI-94. Proceedings of the Twelfth National Conference on Artificial Intelligence.
  9. Fox, M. and Long, D. (2003). Pddl2.1: An extension to pddl for expressing temporal planning domains. Journal of Artificial Intelligence Research, 20:61-124.
  10. Frank, J. and Jonsson, A. (2003). Constraint-Based Attribute and Interval Planning. Constraints, 8(4):339- 364.
  11. Fratini, S., Cesta, A., Orlandini, A., Rasconi, R., and De Benedictis, R. (2011). APSI-based Deliberation in Goal Oriented Autonomous Controllers. In Proc. of 11th ESA Symposium on Advanced Space Technologies in Robotics and Automation (ASTRA).
  12. Fratini, S., Pecora, F., and Cesta, A. (2008). Unifying Planning and Scheduling as Timelines in a ComponentBased Perspective. Archives of Control Sciences, 18(2):231-271.
  13. Ghallab, M. and Laruelle, H. (1994). Representation and Control in IxTeT, a Temporal Planner. In AIPS-94. Proceedings of the 2nd Int. Conf. on AI Planning and Scheduling, pages 61-67.
  14. Jonsson, A., Morris, P., Muscettola, N., Rajan, K., and Smith, B. (2000). Planning in Interplanetary Space: Theory and Practice. In AIPS-00. Proceedings of the Fifth Int. Conf. on AI Planning and Scheduling.
  15. Marques-Silva, J. P., Silva, J. P. M., Sakallah, K. A., and Sakallah, K. A. (1996). GRASP - A New Search Algorithm for Satisfiability. In Proceedings of the International Conference on Computer-Aided Design, pages 220-227.
  16. Moskewicz, M. W., Madigan, C. F., Zhao, Y., Zhang, L., and Malik, S. (2001). Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Annual Design Automation Conference, pages 530-535.
  17. Muscettola, N. (1994). HSTS: Integrating Planning and Scheduling. In Zweben, M. and Fox, M.S., editor, Intelligent Scheduling. Morgan Kauffmann.
  18. Sebastiani, R. (2007). Lazy Satisability Modulo Theories. JSAT, 3(3-4):141-224.
  19. Simonis, H. and Cornelissens, T. (1995). Modelling Producer/Consumer Constraints. In CP-95. Proceedings of the First International Conference on Principles and Practice of Constraint Programming, pages 449- 462, London, UK. Springer-Verlag.
  20. Smith, D., Frank, J., and Jonsson, A. (2000). Bridging the Gap Between Planning and Scheduling. Knowledge Engineering Review, 15(1):47-83.
  21. Zhang, L., Madigan, C. F., Moskewicz, M. H., and Malik, S. (2001). Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. In ICCAD 7801. Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, pages 279-285, Piscataway, NJ, USA. IEEE Press.
Download


Paper Citation


in Harvard Style

De Benedictis R. and Cesta A. (2012). NEW REASONING FOR TIMELINE BASED PLANNING - An Introduction to J-TRE and its Features . In Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-8425-95-9, pages 144-153. DOI: 10.5220/0003746901440153


in Bibtex Style

@conference{icaart12,
author={Riccardo De Benedictis and Amedeo Cesta},
title={NEW REASONING FOR TIMELINE BASED PLANNING - An Introduction to J-TRE and its Features},
booktitle={Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2012},
pages={144-153},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003746901440153},
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 - NEW REASONING FOR TIMELINE BASED PLANNING - An Introduction to J-TRE and its Features
SN - 978-989-8425-95-9
AU - De Benedictis R.
AU - Cesta A.
PY - 2012
SP - 144
EP - 153
DO - 10.5220/0003746901440153