1. J. Dix, H. Munoz-Avila, D. S. Nau, and L. Zhang. IMPACTing SHOP: Putting an AI planner into a multi-agent environment. Annals of Mathematics & Artificial Intelligence, 37(4):381--407, 2003.
   Note: Publisher: Kluwer Academic Publishers, Netherlands.
   Keywords: planning, honours reading, agent programming languages, computational complexity. [abstract] [bibtex-entry]



2. Jim Blythe. Decision-Theoretic Planning. AI Magazine, 20(2):37--54, 1999.
   Keywords: planning, honours reading, decision theory. [bibtex-entry]



3. Craig Boutilier, Thomas Dean, and Steve Hanks. Decision-Theoretic Planning: Structural Assumptions and Computational Leverage. Journal of Artificial Intelligence Research, 11:1--94, 1999.
   Keywords: planning, honours reading, decision theory. [bibtex-entry]



4. Barbara J. Grosz, Luke Hunsberger, and Sarit Kraus. Planning and Acting Together.. Ai magazine., 20(4):23, 1999.
   Keywords: planning, honours reading, agent programming languages, logistics. [bibtex-entry]



5. Lode Missiaen, Maurice Bruynooghe, and Marc Denecker. CHICA, An Abductive Planning System Based on Event Calculus. Journal of Logic and Computation, 5(5):579--602, 1995.
   Keywords: planning, event calculus, abductive logic programming, honours reading. [bibtex-entry]



6. M. W. P. Savelsbergh. The General Pickup and Delivery Problem. Transportation Science, 29(1):17--29, 1995.
   Keywords: planning, honours reading. [bibtex-entry]



7. Manuela Veloso, Jaime Carbonell, Alicia Perez, Daniel Borrajo, Eugene Fink, and Jim Blythe. Integrating Planning and Learning: The PRODIGY Architecture. Journal of Experimental and Theoretical Artificial Intelligence, 7(1):81--120, 1995.
   Keywords: planning, machine learning, honours reading. [bibtex-entry]



8. Tom Bylander. The Computational Complexity of Propositional STRIPS Planning. Artificial Intelligence, 69(1-2):165--204, 1994.
   Keywords: planning, honours reading, computational complexity. [bibtex-entry]

Disclaimer: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.