Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Artificial intelligence and mathematical theory of computation
Some contributions to the metatheory of the situation calculus
Journal of the ACM (JACM)
Using temporal logics to express search control knowledge for planning
Artificial Intelligence
Temporal Planning with Mutual Exclusion Reasoning
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Open World Planning in the Situation Calculus
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
The domestic robot—a friendly cognitive system takes care of your home
Ambient intelligence
Towards High-Level Programming for Distributed Problem Solving
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Generalizing GraphPlan by formulating planning as a CSP
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Planning with resources and concurrency a forward chaining approach
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Human-Robot interaction through mixed-initiative planning for rescue and search rovers
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
We describe the theory and implementation of a deductive planner in the situation calculus for domains with two kinds of actions: 1. "free will" actions on the part of agents with the ability to perform or withhold their actions, like choosing to pick up an object, or deciding to walk to some location. 2.Natural actions whose occurrence times are predictable in advance, in which case they must occur at those times unless something happens to prevent them, for example, objects moving under Newtonian laws, or trains arriving and departing in accordance with known schedules. The theoretical basis for our planner is an extension of the situation calculus to accommodate continuous time and natural actions. The planner itself is patterned after that proposed by (Bacchus and Kabanza, 1995; Bacchus and Kabanza, 2000); it is a forward reasoning planner that filters out partial plans using domain and problem-specific information supplied by the user. The planner is implemented in ECLPSE Prolog, and exploits that system's built-in linear constraint solver to do temporal reasoning. We illustrate the planner's workings on a space platform example that we fully axiomatize in the situation calculus.