Reasoning robots - the art and science of programming robotic agents

The book provides an in-depth and uniform treatment of a mathematical model for reasoning robotic agents. The book also contains an introduction to a programming method and system based on this model. The mathematical model, known as the "Fluent Calculus'', describes how to use classical first-order logic to set up symbolic models of dynamic worlds and to represent knowledge of actions and their effects. Robotic agents use this knowledge and their reasoning facilities to make decisions when following high-level, long-term strategies. The book covers the issues of reasoning about sensor input, acting under incomplete knowledge and uncertainty, planning, intelligent troubleshooting, and many other topics. The mathematical model is supplemented by a programming method which allows readers to design their own reasoning robotic agents. The usage of this method, called "FLUX'', is illustrated by many example programs. The book includes the details of an implementation of FLUX using the standard programming language PROLOG, which allows readers to re-implement or to modify and extend the generic system. The design of autonomous agents, including robots, is one of the most exciting and challenging goals of Artificial Intelligence. Reasoning robotic agents constitute a link between knowledge representation and reasoning on the one hand, and agent programming and robot control on the other. The book provides a uniform mathematical model for the problem-driven, top-down design of rational agents, which use reasoning for decision making, planning, and troubleshooting. The implementation of the mathematical model by a general PROLOG program allows readers to practice the design of reasoning robotic agents. Since all implementation details are given, the generic system can be easily modified and extended.

[1]  Wolfram Burgard,et al.  GOLEX - Bridging the Gap between Logic (GOLOG) and a Real Robot , 1998, KI.

[2]  Michael Gelfond,et al.  Representing Action and Change by Logic Programs , 1993, J. Log. Program..

[3]  Murray Shanahan,et al.  A Circumscriptive Calculus of Events , 1995, Artif. Intell..

[4]  Mikhail Prokopenko,et al.  Causal Propagation Semantics - A Study , 1999, Australian Joint Conference on Artificial Intelligence.

[5]  Murray Shanahan.  Solving the frame problem - a mathematical investigation of the common sense law of inertia , 1997 .

[6]  Willard Van Orman Quine,et al.  Methods of Logic , 1951 .

[7]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[8]  Ray Reiter,et al.  On knowledge-based programming with sensing in the situation calculus , 2001, ACM Trans. Comput. Log..

[9]  Hector Geffner,et al.  Causal Theories for Nonmonotonic Reasoning , 1990, AAAI.

[10]  Witold Lukaszewicz,et al.  Reasoning about Action and Change Using Dijkstra's Semantics for Programming Languages: Preliminary Report , 1995, IJCAI.

[11]  Leora Morgenstern,et al.  Motivated Action Theory: a Formal Theory of Causal Reasoning , 1994, Artif. Intell..

[12]  Jacqueline Vauzeilles,et al.  Generating Plans in Linear Logic I. Actions as Proofs , 1993, Theor. Comput. Sci..

[13]  Vladimir Lifschitz,et al.  A Simple Formalization of Actions Using Circumscription , 1995, IJCAI.

[14]  Enrico Giunchiglia,et al.  Nonmonotonic causal theories , 2004, Artif. Intell..

[15]  Joachim Hertzberg,et al.  How to do Things with Worlds: On Formalizing Actions and Plans , 1993, J. Log. Comput..

[16]  Yoav Shoham,et al.  Deriving properties of belief update from theories of action , 1992, IJCAI.

[17]  Daniel C. Dennett,et al.  Cognitive Wheels: The Frame Problem of AI , 1990, The Philosophy of Artificial Intelligence.

[18]  G. Neelakantan Kartha,et al.  Soundness and Completeness Theorems for Three Formalizations of Action , 1993, IJCAI.

[19]  J. M. Larrazabal,et al.  Reasoning about change , 1991 .

[20]  Lenhart K. Schubert.  Monotonic Solution of the Frame Problem in the Situation Calculus: An Efficient Method for Worlds wi , 1990 .

[21]  Hector J. Levesque,et al.  GOLOG: A Logic Programming Language for Dynamic Domains , 1997, J. Log. Program..

[22]  Fangzhen Lin,et al.  Provably correct theories of action , 1991, JACM.

[23]  Murray Shanahan,et al.  Narratives in the Situation Calculus , 1994, J. Log. Comput..

[24]  Steffen Hölldobler,et al.  Linear Deductive Planning , 1996, J. Log. Comput..

[25]  Thom W. Frühwirth,et al.  Theory and Practice of Constraint Handling Rules , 1998, J. Log. Program..

[26]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[27]  Jonathan Amsterdam.  Temporal Reasoning and Narrative Conventions , 1991, KR.

[28]  John Bell,et al.  Building Models of Prediction Theories , 1998, KR.

[29]  Sebastian Thrun,et al.  Probabilistic Algorithms in Robotics , 2000, AI Mag..

[30]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[31]  Norman Y. Foo,et al.  Preferential Semantics for Causal Systems , 1999, IJCAI.

[32]  R. Smullyan.  First-Order Logic , 1968 .

[33]  Michael Thielscher,et al.  Inferring Implicit State Knowledge and Plans with Sensing Actions , 2001, KI/ÖGAI.

[34]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..

[35]  Mark Witkowski,et al.  High-Level Robot Control through Logic , 2000, ATAL.

[36]  Gerhard Lakemeyer,et al.  cc-Golog: Towards More Realistic Logic-Based Robot Controllers , 2000, AAAI/IAAI.

[37]  Drew McDermott,et al.  Nonmonotonic Logic and Temporal Projection , 1987, Artif. Intell..

[38]  Nils J. Nilsson,et al.  Shakey the Robot , 1984 .

[39]  David E. Smith,et al.  Extending Graphplan to handle uncertainty and sensing actions , 1998, AAAI 1998.

[40]  Raymond Reiter,et al.  Some contributions to the metatheory of the situation calculus , 1999, JACM.

[41]  Hector J. Levesque,et al.  Knowledge, action, and the frame problem , 2003, Artif. Intell..

[42]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[43]  Nicholas Kushmerick,et al.  An Algorithm for Probabilistic Planning , 1995, Artif. Intell..

[44]  Giuseppe De Giacomo,et al.  Planning with Sensing for a Mobile Robot , 1997, ECP.

[45]  Michael Thielscher,et al.  Representing the Knowledge of a Robot , 2000, KR.

[46]  Enrico Giunchiglia,et al.  Representing Action: Indeterminacy and Ramifications , 1997, Artif. Intell..

[47]  Robert A. Kowalski,et al.  The Situation Calculus and Event Calculus Compared , 1994, ILPS.

[48]  John G. Gibbons.  Knowledge in Action , 2001 .

[49]  Vladimir Lifschitz,et al.  Formal Theories of Action (Preliminary Report) , 1987, IJCAI.

[50]  Robert C. Moore.  A Formal Theory of Knowledge and Action , 1984 .

[51]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.