Artificial intelligence and mathematical theory of computation
Conditional nonlinear planning
Proceedings of the first international conference on Artificial intelligence planning systems
On the occur-check-free PROLOG programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Using meta-logic to reconcile reactive with rational agents
Meta-logics and logic programming
Generating optimal policies for high-level plans with conditional branches and loops
New directions in AI planning
Approximate reasoning about actions in presence of sensing and incomplete information
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
ConGolog, a concurrent programming language based on the situation calculus
Artificial Intelligence
Incremental execution of guarded theories
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Getting to the airport: the oldest planning problem in AI
Logic-based artificial intelligence
Projection using regression and sensors
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
What is planning in the presence of sensing?
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
DL Reasoning and AI Planning for Web Service Composition
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
s slGolog: When conditional compositions of web services meet semantic links and causal laws
Web Intelligence and Agent Systems
| Hi-index | 0.01 |
When it comes to buildingrob ot controllers, high-level programming arises as a feasible alternative to planning. The task then is to verify a high-level program by finding a legal execution of it. However, interleavingoffline verification with execution in the world seems to be the most practical approach for large programs and complex scenarios involvinginformation gatheringand exogenous events. In this paper, we present a mechanism for performinglo cal lookahead for the Golog family of high-level robot programs. The main features of such mechanism are that it takes sensingseriously by constructingconditional plans that are ready to be executed in the world, and it mixes perfectly with an account of interleaved perception, planning, and action. Also, a simple implementation is developed.