Book contents
- Frontmatter
- Dedication
- Contents
- List of Algorithms
- Table of Notation
- Foreword
- Preface
- 1 Introduction
- 2 Deliberation with Deterministic Models
- 3 Deliberation with Refinement Methods
- 4 Deliberation with Temporal Models
- 5 Deliberation with Nondeterministic Models
- 6 Deliberation with Probabilistic Models
- 7 Other Deliberation Functions
- 8 Concluding Remarks
- Appendix A Search Algorithms
- Appendix B Strongly Connected Components of a Graph
- Bibliography
- Index
- References
Bibliography
Published online by Cambridge University Press: 05 August 2016
Book contents
- Frontmatter
- Dedication
- Contents
- List of Algorithms
- Table of Notation
- Foreword
- Preface
- 1 Introduction
- 2 Deliberation with Deterministic Models
- 3 Deliberation with Refinement Methods
- 4 Deliberation with Temporal Models
- 5 Deliberation with Nondeterministic Models
- 6 Deliberation with Probabilistic Models
- 7 Other Deliberation Functions
- 8 Concluding Remarks
- Appendix A Search Algorithms
- Appendix B Strongly Connected Components of a Graph
- Bibliography
- Index
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Automated Planning and Acting , pp. 321 - 350Publisher: Cambridge University PressPrint publication year: 2016
References
[1] , , , , and (1994). OPTIMUM-AIV: A knowledge-based planning and scheduling system for spacecraft AIV. In Intelligent Scheduling, pp. 451–469. Morgan Kaufmann.
[2] , , and (2010). Autonomous helicopter aerobatics through apprenticeship learning. Intl. J. Robotics Research, 29(13):1608–1639.Google Scholar
[3] and (2010). Inverse reinforcement learning. In and , editors, Encyclopedia of Machine Learning, pp. 554–558. Springer.
[4] and (1988). Dynamic programming state-space relaxation for single-machine scheduling. J. Operational Research Soc., pp. 141–152.Google Scholar
[5] , , , , and (2000).Representing and reasoning with temporal constraints in multimedia presentations. In Intl. Symp. on Temporal Representation and Reasoning (TIME), pp. 3–12.Google Scholar
[6] (1995). Formulation and implementation of an equipment configuration problem with the SIPE-2 generative planner. In AAAI-95 Spring Symp.on Integrated Planning Applications, pp. 1–10.Google Scholar
[7] and (2004). Generating safe assumption-based plans for partially observable, nondeterministic domains. In Proc. AAAI, pp. 495–500.Google Scholar
[8] , , and (2009). Translating HTNs to PDDL:A small amount of domain knowledge can go a long way. In Proc. IJCAI.
[9] , , , and (2014a). Plan aggregation for strong cyclic planning in nondeterministic domains. Artificial Intelligence, 216:206–232.Google Scholar
[10] ,,,and (2014b).On the feasibility of planning graph style heuristics for HTN planning. In Proc. ICAPS.
[11] (1984).Towards a general theory of action and time. Artificial Intelligence, 23:123–154.Google Scholar
[12] (1991a). Temporal reasoning and planning. In , , , and , editors, Reasoning about Plans, pp. 1–68. Morgan Kaufmann.
[13] (1983). Maintaining knowledge about temporal intervals. Communications ACM, 21(11):832–843.Google Scholar
[14] (1991b). Planning as temporal reasoning. In Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR).
[15] , , and , editors (1990). Readings in Planning. Morgan Kaufmann.
[16] and (1983). Planning using a temporal world model. In Proc. IJCAI.
[17] , , and (2000). Learning plan rewriting rules. In Proc. ICAPS.
[18] and (1988). Integrating planning, execution and monitoring. In Proc. AAAI, pp. 21–26.Google Scholar
[19] , , , , , and (2004).An integrated theory of the mind. Psychological Review, 111(4):1036–1060.Google Scholar
[20] , , and (1997).Generalized prioritized sweeping. In Adv. in Neural Information Processing Syst. (Proc. NIPS).
[21] and (2002). State abstraction for programmable reinforcement learning agents. In Proc. AAAI.
[22] , , , , , , , , , , , and (2003). Business Process Execution Language for Web Services. http://msdn.microsoft.com/en-us/library/ ee251594(v=bts.10).aspx.
[23] , , , and (2010). A closer look at MOMDPs. In IEEE Intl. Conf. on Tools with AI (ICTAI), pp. 197–204.Google Scholar
[24] ,, , and (2009).Asurvey of robot learning from demonstration. Robotics and Autonomous Systems, 57(5):469–483.Google Scholar
[25] (1965).Optimal control of Markov decision processes with incomplete state estimation. J. Math. Analysis and Applications, 10:174–205.Google Scholar
[26] , , and (2014). Finding ways to get the job done: An affordance-based approach. In Proc. ICAPS.
[27] ,,,,and , editors (2003). The Description Logic Handbook: Theory, Implementation and Applications. Cambridge Univ. Press.
[28] and (2000). Using temporal logics to express search control knowledge for planning. Artificial Intelligence, 116(1–2):123–191.Google Scholar
[29] (1991). Planning in polynomial time: The SAS-PUB class. Computational Intelligence, 7:181–197.Google Scholar
[30] and (1993). Complexity results for SAS+ planning. In Proc. IJCAI.
[31] and (1995).Complexity results for SAS+ planning. Computational Intelligence, 11(4):1–34.Google Scholar
[32] , , and (2014). Diagnostic problem solving: a planning perspective. In Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp. 1–10.Google Scholar
[33] (1968).A note on the branch-and-bound principle. Operations Research, 16:442–444.Google Scholar
[34] and (2008). The compression power of symbolic pattern databases. In Proc. ICAPS, pp. 2–11.Google Scholar
[35] , , , and (2006). Constraint-based scheduling and planning. In , , and , editors, Handbook of constraint programming, chapter 22, pp. 759–798. Elsevier.
[36] ,, , and (2006). Implementation and flight testing of an onboard architecture for mission supervision. In Intl. Unmanned Air Vehicle Syst. Conf.
[37] , , , , , , , and (2012). EUROPA: A platform for AI planning, scheduling, constraint programming, and optimization. In Intl. Competition on Knowledge Engg. for Planning and Scheduling (ICKEPS).
[38] , ,, and (1993).UCPOP user's manual (version 2.0). Technical Report TR-93-09-06, Univ. ofWashington, Dept. of Computer Science and Engineering.
[39] and (1993). Characterizing subgoal interactions for planning. In Proc. IJCAI, pp. 1388–1393.Google Scholar
[40] and (1994). Partial order planning: Evaluating possible efficiency gains. Artificial Intelligence, 67(1):71–112.Google Scholar
[41] ,,and (2010).The SMT-LIB standard:Version 2.0. In and , editors, 8th Intl. Wksp. on Satisfiability Modulo Theories.
[42] , , and (2010). Hierarchical solution of large Markov decision processes. In ICAPS Workshop, pp. 1–8.Google Scholar
[43] , , and (2011). DetH*: Approximate hierarchical solution of large Markov decision processes. In Proc. IJCAI, pp. 1–8.Google Scholar
[44] , , and (2014). An Introduction to Constraint-Based Temporal Reasoning.Morgan & Claypool.
[45] , , and (2010). Constraint satisfaction techniques in planning and scheduling. J. Intelligent Manufacturing, 21(1):5–15.Google Scholar
[46] , , and (1995). Learning to act using real-time dynamicprogramming. Artificial Intelligence, 72:81–138.Google Scholar
[47] (1999).Structured reactive controllers:Controlling robots that perform everyday activity. In Proc. Annual Conf. on Autonomous Agents, pp. 228–235.ACM.
[49] and (1994). Improving robot plans during their execution. In Proc. AIPS.
[50] (1957).Dynamic Programming. Princeton Univ. Press.
[51] and (2002).Reasoning about robot actions: a model checking approach. In ,, , and , editors, Advances in Plan-Based Control of Robotic Agents, pp. 123–139. Springer.
[52] , , and (2014). Hybrid planning heuristics based on task decomposition graphs. International Symposium on Combinatorial Search (SoCS), pp. 1–9.Google Scholar
[53] , , , , , , , , , and (2000). Remote agent experiment DS1 technology validation report. Technical report, NASA.
[54] , ,, and (2013).Aknowledge engineering environment for P&S with timelines. In Proc. ICAPS, pp. 16–23.Google Scholar
[55] and (2011). Finding mutual exclusion invariants in temporal planning domains. In Intl. Wksp. on Planning and Scheduling for Space (IWPSS).
[56] and (2007).Developing domain-independent search control for Europa2. In ICAPS Wksp. on Heuristics for Domain-Independent Planning.
[57] and (2008). Automatically generated heuristic guidance for Europa2. In Intl. Symp. on Artificial Intell., Robotics and Automation in Space (i-SAIRAS).
[58] and (2009). Towards search control via dependency graphs in Europa2. In ICAPS Wksp. on Heuristics for Domain-Independent Planning.
[59] , , , , and (2001a). MBP: a model based planner.In IJCAIWksp.on Planning underUncertainty and Incomplete Information, pp. 93–97.Google Scholar
[60] ,, , and (2003).A framework for planning with extended goals under partial observability. In Proc. ICAPS.
[61] , , , and (2001b). Planning in nondeterministic domains under partial observability via symbolic model checking. In Proc. IJCAI, pp. 473–478.Google Scholar
[62] , , , and (2006). Strong planning under partial observability. Artificial Intelligence, 170(4):337–384.Google Scholar
[63] , , and (2004). Interleaving execution and planning for nondeterministic, partially observable domains. In Proc. ECAI, pp. 657–661.Google Scholar
[64] , , and (2010). Automated composition of Web services via planning in asynchronous domains. Artificial Intelligence, 174(3-4):316–361.Google Scholar
[65] (2001).Dynamic Programming and Optimal Control.Athena Scientific.
[66] and (1996). Neuro-Dynamic Programming.Athena Scientific.
[67] and (1991).An analysis of stochastics shortest path problems. Mathematics of Operations Research, 16(3):580–595.Google Scholar
[68] and (2009). Planning with h+ in theory and practice. In Proc.Annual German Conf. on AI (KI), volume 5803. Springer.
[69] , , and (2010). Sampling-based motion planning with temporal goals. In IEEE Intl. Conf. on Robotics and Automation (ICRA), pp. 2689–2696. IEEE.
[70] and (2009a). Insightful problem solving and creative tool modification by captive nontool-using rooks. Proc. Natl. Acad. of Sci. (PNAS), 106(25):10370–10375.Google Scholar
[71] and (2009b). Rooks use stones to raise the water level to reach a floating worm. Current Biology, 19(16):1410–1414.Google Scholar
[72] and (2001). From abstract crisis to concrete relief – A preliminary report on combining state abstraction and HTN planning. In Proc. European Conf. on Planning (ECP), pp. 157–168.Google Scholar
[73] and (1999). Probabilistic planning in the graphplan framework. In Proc. European Conf. on Planning (ECP), pp. 319–322. Springer.
[74] and (1997).Fast planning through planning graph analysis. Artificial Intelligence, 90(1–2):281–300.Google Scholar
[75] and (1989). Solving time-dependent planning problems. In Proc. IJCAI, pp. 979–984.Google Scholar
[76] and (2009).Autonomously controlled storage management in vehicle logistics applications of RFID and mobile computing systems. Intl. J. RF Technologies: Research and Applications, 1(1):57–76.Google Scholar
[77] , , , and (2015). PDDL+ planning with hybrid automata: Foundations of translating must behavior. In Proc. ICAPS, pp. 42–46.Google Scholar
[78] , , , and (2014). Planning as model checking in hybrid domains. In Proc. AAAI, pp. 2228–2234.Google Scholar
[79] , , ,, ,,, , and (2011). Towards autonomous robotic butlers: Lessons learned with the PR2. In IEEE Intl. Conf. on Robotics and Automation (ICRA), pp. 5568–5575.Google Scholar
[80] (2007). On the speed of convergence of value iteration on stochastic shortestpath problems. Mathematics of Operations Research, 32(2):365–373.Google Scholar
[81] and (2000). Planning with incomplete information as heuristic search in belief space. In Proc. AIPS, pp. 52–61.Google Scholar
[83] and (2003a). Faster heuristic search algorithms for planning with uncertainty and full feedback. In Proc. IJCAI.
[84] and (2003b).LabeledRTDP:Improving the convergence of real-time dynamic programming. In Proc. ICAPS, pp. 12–21.Google Scholar
[85] and (2005).mGPT:Aprobabilistic planner based on heuristic search. J. Artificial Intelligence Research, 24:933–944.Google Scholar
[86] and (2006). Learning in depth-first search: A unified approach to heuristic search in deterministic, non-deterministic, probabilistic, and game tree settings. In Proc. ICAPS, pp. 142–151.Google Scholar
[87] and (2009). Solving POMDPs:RTDP-Bel vs. point-based algorithms. In Proc. IJCAI, pp. 1641–1646.Google Scholar
[88] and (2012).Action selection for MDPs: Anytime AO* versus UCT. In Proc. AAAI.
[89] and (2014). Belief tracking for planning with sensing:Width, complexity and approximations. J. Artificial Intelligence Research, 50:923–970.Google Scholar
[90] and (2010). Strengthening landmark heuristics via hitting sets. In Proc. ECAI, pp. 329–334.Google Scholar
[91] , , and (2007). Semantic knowledge-based execution monitoring for mobile robots. In IEEE Intl. Conf. on Robotics and Automation (ICRA), pp. 3693–3698. IEEE.
[92] , , and (1998). Structured reachability analysis for Markov decision processes. In Proc. Conf. on Uncertainty in AI (UAI), pp. 24–32.Google Scholar
[93] , , and (1999). Decision-theoretic planning: Structural assumptions and computational leverage. J. Artificial Intelligence Research, 11:1–94.Google Scholar
[94] , , and (2000). Stochastic dynamic programming with factored representations. Artificial Intelligence, 121:49–107.Google Scholar
[95] and (2001). Exact solutions to time dependent MDPs. In Adv. in Neural Information Processing Syst. (Proc. NIPS), pp. 1026–1032.Google Scholar
[96] and (2004). Conformant planning via heuristic forward search: A new approach. In Proc. ICAPS.
[97] and (2009). Continual planning and acting in dynamic multiagent environments. J. Autonomous Agents and Multi-Agent Syst., 19(3):297–331.Google Scholar
[98] , , , and (1998).A spectrum of definitions for temporal model-based diagnosis. Artificial Intelligence, 102(1):39–79.Google Scholar
[99] , , , and (1999). Qualitative and quantitative temporal constraints and relational databases: Theory, architecture, and applications. IEEE trans. on KDE, 11(6):948–968.Google Scholar
[100] , , , and (2012). Dynamic adaptation of fragment-based and context-aware business processes. In Intl. Conf. on Web Services, pp. 33–41.Google Scholar
[101] , , , , , and (2013).Domain objects for continuous context-aware adaptation of service-based systems. In ICWS, pp. 571–578.Google Scholar
[102] and , editors (2010). Markov Decision Processes in Artificial Intelligence. Wiley.
[103] ,, , and (2011). Optimistic planning for sparsely stochastic systems. In IEEE Symp. on Adaptive Dynamic Progr. and Reinforcement Learning, pp. 48–55.Google Scholar
[104] (1992). Complexity results for extended planning. In Proc. AAAI.
[105] (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69:165–204.Google Scholar
[106] ,, and (2002).Reasoning about actions and planning in ltl action theories. In Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp. 593–602. Morgan Kaufmann.
[107] ,, and (2001). Improvements to SAT-based conformant planning. In and , editors, Proc. European Conf. on Planning (ECP).
[108] , , and (2003). SAT-based planning in complex domains: Concurrency, constraints and nondeterminism. Artificial Intellegence, 147:85–118.Google Scholar
[109] , , and (2006a). Efficiently handling temporal knowledge in an HTN planner. In Proc. ICAPS, pp. 1–10.Google Scholar
[110] , , , and (2006b). Efficiently handling temporal knowledge in an HTN planner. In Proc. ICAPS, pp. 63–72.Google Scholar
[111] and (1996). Gaining efficiency and flexibility in the simple temporal problem. In Intl. Symp. on Temporal Representation and Reasoning (TIME).
[112] , , and (2002).Aconstraint-based method for project scheduling with time windows. J. Heuristics, 8(1):109–136.Google Scholar
[113] , , and (2009). The AI for Killzone 2's multiplayer bots. In Game Developers Conf. (GDC).
[115] , , , and (1992). Integrated planning and execution control of autonomous robot actions. In IEEE Intl. Conf. on Robotics and Automation (ICRA), pp. 2689–2696.Google Scholar
[116] (2010). Combining learning techniques for classical planning:Macro-operators and entanglements. In IEEE Intl. Conf. on Tools with AI (ICTAI), volume 2, pp. 79–86. IEEE.
[117] , ,,,,,, and (1997). A provably correct embedded verifier for the certification of safety critical software. In Intl. Conf. on Computer Aided Verification (CAV), pp. 202–213.Google Scholar
[118] , , and (2012a). Solving temporal problems using SMT: Strong controllability. In Proc. Int. Conf. Principles and Practice of Constraint Programming (CP).
[119] , , and (2012b). Solving temporal problems using SMT: Weak controllability. In Proc. AAAI.
[120] ,, and (2015). Strong temporal planning with uncontrollable durations:A state-space approach. In Proc. AAAI, pp. 1–7.Google Scholar
[121] , ,, and (2003).Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence, 147(1–2):35–84.Google Scholar
[122] , , and (1998a). Automatic OBDD-based generation of universal plans in non-deterministic domains. In Proc. AAAI, pp. 875–881.Google Scholar
[123] , , and (1998b). Strong planning in non-deterministic domains via model checking. In Proc.AIPS, pp. 36–43.Google Scholar
[124] , , , and (2012). Platas—integrating planning and the action language Golog. KI-Künstliche Intelligenz, 26(1):61–67.Google Scholar
[125] , , and (2009). Apprenticeship learning for helicopter control. Communications ACM, 52(7):97.Google Scholar
[126] and (2007). Marvin: a heuristic search planner with onlinemacro-action learning. J. Artificial Intelligence Research, 28:119–156.Google Scholar
[127] , , , and (2008). Planning with problems requiring temporal coordination. In Proc. AAAI.
[128] , , , and (2012). COLIN: planning with continuous linear numeric change. J. Artificial Intelligence Research.
[129] , , and (2009). Flexible execution of plans with choice. In Proc. ICAPS.
[130] and (2002). Perceptual anchoring: a key concept for plan execution in embedded systems. In , , , and , editors, Advances in Plan-Based Control of Robotic Agents, pp. 89–105. Springer-Verlag.
[131] , , , and (2001). Introduction to Algorithms. MIT Press.
[133] and (1991). O-Plan: The open planning architecture. Artificial Intelligence, 52(1):49–86.Google Scholar
[134] and (2007). Prioritizing Bellman backups without a priority queue. In Proc. ICAPS, pp. 113–119.Google Scholar
[135] , , and (2002). Planning with a language for extended goals. In Proc. AAAI, pp. 447–454.Google Scholar
[136] , , and (1999). Strong cyclic planning revisited. In Proc. European Conf. on Planning (ECP), pp. 35–48.Google Scholar
[137] , ,,and (1997).Description logic-based framework for planning with sensing actions. In Intl. Wksp. on Description Logics.
[138] , , , and (1999).A theory and implementation of cognitive mobile robots. J. Logic and Computation, 9(5):759–785.Google Scholar
[139] , , and (2013). Automatic behavior composition synthesis. Artificial Intelligence, 196.Google Scholar
[140] and (2011). Learning domain control knowledge for TLPlan and beyond. In ICAPS Wksp. on Learning and Planning.
[141] , , and (1988).Hierarchical planning involving deadlines, travel time and resources. Computational Intelligence, 6(1):381–398.Google Scholar
[142] , , and (1997). Model reduction techniques for computing approximately optimal solutions for Markov decision processes. In Proc. Conf. on Uncertainty in AI (UAI), pp. 124–131.Google Scholar
[143] and (1989).Amodel for reasoning about persistence and causation. Computational Intelligence, 5(3):142–150.Google Scholar
[144] and (1995). Decomposition techniques for planning in stochastic domains. In Proc. IJCAI, pp. 1121–1127.Google Scholar
[146] and (1991). Planning and Control.Morgan Kaufmann.
[147] , , and (1991). Temporal constraint networks. Artificial Intelligence, 49:61–95.Google Scholar
[148] ,,and (2013).Asurvey on policy search for robotics. Foundations and Trends in Robotics, 2(1–2):1–142.Google Scholar
[149] , , , and (2009). UPMurphi: A tool for universal planning on PDDL+ problems. In Proc. ICAPS.
[150] (1996). Kinds of Minds. Perseus.
[151] (1970). Finite State Markovian Decision Processes.Academic Press.
[152] and (1999). Propice-Plan: Toward a unified framework for planning and execution. In Proc. European Conf. on Planning (ECP).
[153] (2000). Hierarchical reinforcement learning with the maxq value function decomposition. J. Artificial Intelligence Research, 13:227–303.Google Scholar
[154] and (2001). Sapa:Adomain independent heuristicmetric temporal planner. In Proc. European Conf. on Planning (ECP), pp. 109–121.Google Scholar
[155] and (1999). TALplanner: An empirical investigation of a temporal logic-based forward chaining planner. In Intl. Symp. on Temporal Representation and Reasoning (TIME), pp. 47–54.Google Scholar
[156] and (2001). TALplanner: A temporal logic based planner. AI Magazine, 22(3):95–102.Google Scholar
[157] , , and (2009a). A temporal logic-based planning and execution monitoring framework for unmanned aircraft systems. J. Autonomous Agents and Multi-Agent Syst., 19(3):332–377.Google Scholar
[158] , , and (2009b). A temporal logic-based planning and execution monitoring framework for unmanned aircraft systems. J. Autonomous Agents and Multi-Agent Syst., 19(3):332–377.Google Scholar
[159] , , and (2012). Online speedup learning for optimal planning. J. Artificial Intelligence Research.
[160] and (1966).Experiments with the graph traverser program.Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences, 294(1437):235–259.Google Scholar
[161] and (2010). Modern Control Systems. Prentice Hall.
[162] ,,and (1993).Situation recognition:Representation and algorithms. In Proc. IJCAI, pp. 166–172.Google Scholar
[163] and (2007).Chronicle recognition improvement using temporal focusing and hierarchization. In Proc. IJCAI, pp. 324–329.Google Scholar
[164] and (1997). Eight maximal tractable subclasses of Allen's algebra with metric time. J. Artificial Intelligence Research, 7:25–45.Google Scholar
[165] , , , and (2014). A flexible ANML actor and planner in robotics. In and , editors, ICAPS Wksp. on Planning and Robotics, pp. 12–19.
[166] and (1962). Optimal pursuit strategies in discrete state probabilistic systems. Trans. ASME, 84:23–29.Google Scholar
[167] (2001).Planning with pattern databases. In Proc.European Conf.on Planning (ECP).
[168] (2002). Symbolic pattern databases in heuristic search planning. In Proc. AIPS, pp. 274–283.Google Scholar
[169] (2003). Taming numbers and durations in the model checking integrated planning system. J. Artificial Intelligence Research, 20:195–238.Google Scholar
[170] and (1999).Exhibiting knowledge in planning problems to minimize state encoding length. In and , editors, Proc. European Conf. on Planning (ECP), volume 1809 of LNAI, pp. 135–147. Springer.
[171] and (2000).On the implementation of MIPS. In AIPS Wksp. on Model-Theoretic Approaches to Planning, pp. 18–25.Google Scholar
[172] and (2009). Optimal symbolic planning with action costs and preferences. In Proc. IJCAI, pp. 1690–1695.Google Scholar
[173] , , and (2014). Symbolic and explicit search hybrid through perfect hash functions – A case study in Connect Four. In Proc. ICAPS.
[174] , , and (2015). BDDs strike back (in AI planning). In Proc. AAAI, pp. 4320–4321.Google Scholar
[175] ,, and (2010).Dynamic execution of temporally and spatially flexible reactive programs. In AAAI Wksp. on Bridging the Gap between Task and Motion Planning, pp. 1–8.Google Scholar
[176] and (1996). Temporal and resource reasoning in planning: the ParcPlan approach. In Proc. ECAI, pp. 614–618.Google Scholar
[177] , , , and (2012). Improving hierarchical planning performance by the use of landmarks. Proc. AAAI.
[178] (1990). Temporal and modal logic. In , editor, Handbook of Theoretical Computer Sci., Volume B: Formal Models and Semantics, pp. 995–1072. Elsevier.
[179] , , and (1994a). HTN planning: Complexity and expressivity. In Proc. AAAI.
[180] , , and (1994b). Semantics for hierarchical task-network planning. Technical Report CS TR-3239, Univ. of Maryland.
[181] , , and (1994c). UMCP:A sound and complete procedure for hierarchical task-network planning. In Proc. AIPS, pp. 249–254.Google Scholar
[182] , , and (1995). Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence, 76(1–2):75–88.Google Scholar
[183] ,,and (1997). An argument for a hybrid HTN/operator-based approach to planning. In Proc. European Conf. on Planning (ECP), pp. 184–196.Google Scholar
[184] , , , , , and (1992). An approach to planning with incomplete information. In Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp. 115–125.Google Scholar
[185] , , and (2009). Using the context-enhanced additive heuristic for temporal and numeric planning. In Proc. ICAPS.
[186] , , and (2012). Using the context-enhanced additive heuristic for temporal and numeric planning. In , , , and ,editors,Towards ServiceRobots for Everyday Environments:RecentAdvances in Designing Service Robots for Complex Tasks in Everyday Environments, pp. 49–64. Springer.
[187] , , , and (1998). Using temporal constraint networks to manage temporal scenario of multimedia documents. In ECAI Wksp. on Spatial and Temporal Reasoning.
[188] , , , and (2004).Dynamic programming for structured continuous Markov decision problems. In Proc. AAAI, pp. 154–161.Google Scholar
[189] and (2002). Symbolic heuristic search for factoredMarkov decision processes. In Proc. AAAI, pp. 455–460.Google Scholar
[190] , , and (2002). Symbolic generalization for on-line planning. In Proc. Conf. on Uncertainty in AI (UAI), pp. 209–216.Google Scholar
[191] and (2004). Focussed propagation ofMDPs for path planning. In IEEE Intl. Conf. on Tools with AI (ICTAI), pp. 310–317.Google Scholar
[192] and (2006).Probabilistic policy reuse in a reinforcement learning agent. In Proc. AAMAS, pp. 720–727.ACM.Google Scholar
[193] and (2000). Planning as satisfiability in nondeterministic domains. In Proc. AAAI.
[194] and (2008). Logic-based robot control in highly dynamic domains. Robotics and Autonomous Systems, 56(11):980–991.Google Scholar
[195] , , and (2003). Intelligent execution monitoring in dynamic environments. Fundamenta Informaticae, 57(2–4):371–392.Google Scholar
[196] (1971). Monitored execution of robot plans produced by STRIPS. In <I>IFIP Congress.
[197] and (1971). STRIPS:A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2(3):189–208.Google Scholar
[198] , , and (2000). Open world planning in the situation calculus. In Proc. AAAI, pp. 754–760.Google Scholar
[199] (1987). An investigation into reactive planning in complex domains. In Proc. AAAI, pp. 202–206. AAAI Press.
[200] ,, and , editors (2005). Handbook of Temporal Reasoning in Artificial Intelligence. Elsevier.
[201] and (2007).Real-time hierarchical POMDPs for autonomous robot navigation. Robotics and Autonomous Systems, 55:561–571.Google Scholar
[202] and (1978). Multilayer control of large Markov chains.IEEE Trans. Automation and Control, 23:298–304.Google Scholar
[203] and (2000). Utilizing automatically inferred invariants in graph construction and search. In Proc. ICAPS, pp. 102–111.Google Scholar
[204] and (2003). PDDL2.1: An extension to PDDL for expressing temporal planning domains. J. Artificial Intelligence Research, 20:61–124.Google Scholar
[205] and (2006). Modelling mixed discrete-continuous domains for planning. J. Artificial Intelligence Research, 27:235–297.Google Scholar
[207] , , and (2004).Plan execution in dynamic environments. In Proc. Intl. Cognitive Robotics Workshop, pp. 208–217. Springer.
[208] ,, , , and (2011).APSI-based deliberation in goal oriented autonomous controllers. In Symp. on Adv. in Space Technologies in Robotics and Automation (ASTRA).
[209] , ,, and (2011). Simple and fast strong cyclic planning for fully-observable nondeterministic planning problems. In Proc. IJCAI, pp. 1949–1954.Google Scholar
[210] , , , , , , and (2007).Video understanding for complex activity recognition. Machine Vision and Applications, 18(3–4):167–188.Google Scholar
[211] , , and (1989). Model predictive control: theory and practice – a survey. Automatica, 25(3):335–348.Google Scholar
[212] and (1995).Hierarchisation of the search space in temporal planning. In European Wksp. on Planning (EWSP), pp. 235–249.
[213] and (1979). Computers and Intractability:AGuide to the Theory of NP-Completeness. W.H. Freeman.
[214] (2002). A temporal plannnig system for level 3 durative actions of PDDL2.1. In AIPS Wksp. on Planning for Temporal Domains, pp. 56–66.
[215] (2000). Functional Strips:A more flexible language for planning and problem solving. In , editor, Logic-Based Artificial Intelligence, pp. 187–209. Kluwer.
[216] (2003). PDDL 2.1: Representation vs. computation. J. Artificial Intelligence Research, 20:139–144.Google Scholar
[217] and (2013).A Concise Introduction toModels andMethods for Automated Planning. Morgan & Claypool.
[218] and (2009). A probabilistic plan recognition algorithm based on plan tree grammars. Artificial Intelligence, 173:1101–1132.Google Scholar
[219] and (2007). Combining online and offline knowledge in UCT. In Proc. Intl. Conf. on Machine Learning (ICML), pp. 273–280.Google Scholar
[220] , , , , and (2008). Combining domain-independent planning and HTN planning: The Duet planner. In Proc. ECAI, pp. 573–577.Google Scholar
[221] , , and (2003). Planning through stochastic local search and temporal action graphs in LPG. J. Artificial Intelligence Research, 20:239–290.Google Scholar
[222] , , and (2005). Integrating planning and temporal reasoning for domains with durations and time windows. In Proc. IJCAI, volume 19, pp. 1226– 1232.Google Scholar
[223] and (1996). Accelerating partial-order planners:Some techniques for effective search control and pruning. J. Artificial Intelligence Research, 5:95–137.Google Scholar
[224] and (2000). Discovering state constraints inDISCOPLAN:Some new results. In Proc. AAAI.
[225] and (2002). LPG: A planner based on local search for planning graphs. In Proc. AIPS, pp. 968–973.
[226] (1996). On chronicles: Representation, on-line recognition and learning. In Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp. 597– 606.
[227] , , and (1987). Dealing with time in planning and execution monitoring. In and , editors, Intl. Symp. on Robotics Research (ISRR), pp. 431–443. MIT Press.
[228] and (1994). Representation and control in IxTeT, a temporal planner. In Proc. AIPS, pp. 61–67.
[229] and (1989). Managing efficiently temporal relations through indexed spanning trees. In Proc. IJCAI, pp. 1297–1303.
[230] , , and (2004). Automated Planning: Theory and Practice. Morgann Kaufmann.
[231] , , and (2014). The actor's view of automated planning and acting:A position paper. Artificial Intelligence, 208:1–17.Google Scholar
[232] (summer 2005).Description logics and planning. AI Magazine.
[233] (1988). The equational theory of pomsets. Theoretical Computer Science, 61(2):199–224.Google Scholar
[234] (2000). Planning as satisfiability with expressive action languages: Concurrency, constraints and nondeterminism. In Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp. 657–666.
[235] (1999). Using Abstrips abstractions – where do we stand?
AI Review, 13(3):201–213.Google Scholar
[236] and (1999). Planning as model checking. In Proc. European Conf. on Planning (ECP), pp. 1–20.
[237] , , and (2003). Equivalence notions and model minimization in Markov decision processes. Artificial Intelligence, 142:163–223.Google Scholar
[238] , , and (1994). Omnipotence without omniscience: Efficient sensor management for planning. In Proc. AAAI, pp. 1048–154.Google Scholar
[239] , , and (1999). Hard real-time mode logic synthesis for hybrid control:A CIRCA-based approach. In Hybrid Systems and AI: Papers from the AAAI Spring Symp. AAAI Technical Report SS-99-05.
[240] , , , and (1997). Dynamic abstraction planning. In Proc. AAAI, pp. 680–686. AAAI Press.
[241] , , and (2000). Using model checking to plan hard real-time controllers. In AIPS Wksp. on Model-Theoretic Approaches to Planning.
[242] and (1993). Complexity and algorithms for reasoning about time: a graph-theoretic approach. J. ACM, 40(5):1108–1133.Google Scholar
[243] , , , et al. (2009). JABBAH: a java application framework for the translation between business process models and HTN. In Proc. Intl.Competition onKnowledge Engineering for Planning and Scheduling (ICKEPS).Google Scholar
[244] (1963). Control Systems: Principles and Design. McGraw-Hill.
[245] , , and (2007). A meta-CSP model for optimal planning. In Abstraction, Reformulation, and Approximation, pp. 200–214. Springer.
[246] , , , and (2012). Planning modulo theories: Extending the planning paradigm. In Proc. ICAPS.
[247] (2009). Ontology. In Encyclopedia ofDatabase Systems,pp. 1963–1965. Springer.
[248] , , and (2004). Solving factored MDPs with continuous and discrete variables. In Proc. Conf. on Uncertainty in AI (UAI), pp. 235–242.Google Scholar
[249] , , , and (2003). Efficient solution algorithms for factored MDPs. J. Artificial Intelligence Research, 19:399–468.Google Scholar
[250] and (2010). Multi-tasking SLAM. In IEEE Intl. Conf. on Robotics and Automation (ICRA), pp. 377–384.Google Scholar
[251] , , and (1998). GOLEX – bridging the gap between logic (GOLOG) and a real robot. In Proc.Annual German Conf. on AI (KI), pp. 165–176. Springer.
[252] and (1990). Issues and architectures for planning and execution. In Proc. Wksp. on Innovative Approaches to Planning, Scheduling and Control, pp. 59–70. Morgan Kaufmann.
[253] (2011). Suboptimality bounds for stochastic shortest path problems. In Proc. Conf. on Uncertainty in AI (UAI), pp. 301–310.Google Scholar
[254] and (2001). LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence, 129(1):35–62.Google Scholar
[255] , , and (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst., Man, and Cybernetics, pp. 1556– 1562.Google Scholar
[256] , , and (1972). Correction to a formal basis for the heuristic determination of minimum cost paths.ACM SIGART Bulletin, 37:28–29.Google Scholar
[257] and (2008). Fusing DL reasoning with HTN planning. In Proc. Annual German Conf. on AI (KI), pp. 62–69. Springer.
[258] (2009). Admissible makespan estimates for PDDL2.1 temporal planning. In ICAPS Wksp. on Heuristics for Domain-Independent Planning.
[259] , , and (2005). New admissible heuristics for domainindependent planning. In Proc. AAAI.
[260] , , , , and (2007). Domain-independent construction of pattern database heuristics for cost-optimal planning. In Proc. AAAI, volume 7, pp. 1007–1012.Google Scholar
[261] and (2000). Admissible heuristics for optimal planning. In Proc. AIPS, pp. 140–149.Google Scholar
[262] and (2001). Heuristic plannnig with time and resources. In Proc. European Conf. on Planning (ECP), pp. 121–132.Google Scholar
[263] , , , , and (1998). Hierarchical solution of Markov decision processes using macro-actions. In Proc. Conf. on Uncertainty in AI (UAI), pp. 220–229.Google Scholar
[264] (2011). A survey of motivation frameworks for intelligent systems. Artificial Intelligence, 175(5):1020–1036.Google Scholar
[265] , , and (2010). Bridging the sense-reasoning gap: DyKnow – stream-based middleware for knowledge processing. Advanced Engineering Informatics, 24(1):14–26.Google Scholar
[266] (2004). A planning heuristic based on causal graph analysis. In Proc. ICAPS.
[267] (2006). The Fast Downward planning system. J. Artificial Intelligence Research, 26:191–246.Google Scholar
[268] (2009). Concise finite-domain representations for PDDL planning tasks. Artificial Intelligence, 173(5):503–535.Google Scholar
[269] and (2009). Landmarks, critical paths and abstractions:What's the difference anyway? In Proc. ICAPS, pp. 162–169.Google Scholar
[270] and (2008). Unifying the causal graph and additive heuristics. In Proc. ICAPS, pp. 140–147.Google Scholar
[271] , , and (2007). Flexible abstraction heuristics for optimal sequential planning. In Proc. ICAPS, pp. 176–183.Google Scholar
[272] , , and (2008). Explicit-state abstraction:Anew method for generating heuristic functions. In Proc. AAAI, pp. 1547–1550.Google Scholar
[273] , , , and (2014). Merge-and-shrink abstraction: A method for generating lower bounds in factored state spaces. J. ACM, 61(3):16.Google Scholar
[274] (1996). The theory of hybrid automata. In IEEE Symp. on Logic in Computer Sci., pp. 278–292.Google Scholar
[275] , , , and (1999). SPUDD: Stochastic planning using decision diagrams. In Proc. Conf. on Uncertainty in AI (UAI), pp. 279–288.Google Scholar
[277] (2003). The metric-FF planning system: Translating “ignoring delete lists” to numeric state variables. J. Artificial Intelligence Research, 20:291–341.Google Scholar
[278] (2005). Where “ignoring delete lists”works: local search topology in planning benchmarks. J. Artificial Intelligence Research, pp. 685–758.Google Scholar
[279] and (2005). Contingent planning via heuristic forward search with implicit belief states. In Proc. ICAPS.
[280] and (2001). The FF planning system: Fast plan generation through heuristic search. J. Artificial Intelligence Research, 14:253–302.Google Scholar
[281] , , and (2004). Ordered landmarks in planning. J. Artificial Intelligence Research, 22:215–278.Google Scholar
[282] and (2010). Exploiting spatial and temporal flexibility for exploiting spatial and temporal flexibility for plan execution of hybrid, under-actuated systems. In Cognitive Robotics.
[283] , , and (2010). Learning methods to generate good plans: Integrating HTN learning and reinforcement learning. In Proc. AAAI.
[284] , , and (2004). Video-based event recognition: activity representation and probabilistic recognition methods. Computer Vision and Image Understanding, 96(2):129–162.Google Scholar
[285] (2006). Operations research methods in constraint programming. In , , and , editors, Handbook of Constraint Programming, pp. 527–570. Elsevier.
[286] , , and (2006). Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.
[287] and (1996). Computer Algorithms. W.H. Freeman.
[288] (1971). Dynamic Probabilistic Systems. Wiley.
[289] , , and (2009). An optimal temporally expressive planner: Initial results and application to P2P network optimization. In Proc. ICAPS.
[290] (1976). Theoretical comparision of search strategies in branch and bound. International Journal of Computer and Information Sciences, 5:315–344.Google Scholar
[291] ICAPS (2015). ICAPS competitions. http://icaps-conference.org/index.php/Main/ Competitions. [Accessed: 16 August 2015].
[292] , , and (2001).A reactive model-based programming language for robotic space explorers. In Intl. Symp. on Artificial Intell., Robotics and Automation in Space (i-SAIRAS).
[293] , , , and (1996). PRS: A high level supervision and control language for autonomous mobile robots. In IEEE Intl. Conf. on Robotics and Automation (ICRA), pp. 43–49.Google Scholar
[294] and (2015). Deliberation for Autonomous Robots: A Survey. Artificial Intelligence (In Press).
[295] , , , , and (2014). Optimal planning with global numerical state constraints. In Proc. ICAPS.
[296] and (2002). Distributed graphplan. In IEEE Intl. Conf. on Tools with AI (ICTAI), pp. 138–145. IEEE.Google Scholar
[297] and (2000). OBDD-based universal planning for synchronized agents in non-deterministic domains. J. Artificial Intelligence Research, 13:189–226.Google Scholar
[298] , , and (2003). Guided symbolic universal planning. In Proc. ICAPS.
[299] , , and (2001). OBDD-based optimistic and strong cyclic adversarial planning. In Proc. European Conf. on Planning (ECP).
[300] , , , , and (2012). A review of machine learning for automated planning. The Knowledge Engg. Review, 27(4):433–467.Google Scholar
[301] , , , , and (2000). Planning in interplanetary space: Theory and practice. In AIPS, pp. 177–186.Google Scholar
[302] , , and (1999). Computational complexity of relating time points and intervals. Artificial Intelligence, 109:273–295.Google Scholar
[303] , , and (2012). Active imitation learning via reduction to IID active learning. In Proc. Conf. on Uncertainty in AI (UAI), pp. 428–437.Google Scholar
[304] , , and (1997). Planning control rules for reactive agents. Artificial Intelligence, 95(1):67–113.Google Scholar
[305] , , and (1998). Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101:99–134.Google Scholar
[306] (1993). On the utility of systematicity: Understanding the trade-offs between redundancy and commitment in partial-order planning. In Proc. IJCAI, pp. 1380–1385.
[307] (1995). A comparative analysis of partial order planning and task reduction planning. SIGART Bulletin, 6(1).Google Scholar
[308] (2003). Are we comparing Dana and Fahiem or SHOP and TLPlan? A critique of the knowledge-based planning track at ICP. http://rakaposhi.eas.asu.edu/ kbplan.pdf.
[309] and (1992). A validation-structure-based theory of plan modification and reuse. Artificial Intelligence, 55:193–258.Google Scholar
[310] , , and (1995). Planning as refinement search: A unified framework for evaluating design tradeoffs in partial-order planning. Artificial Intelligence, 76(1–2):167–238.Google Scholar
[311] and (1996). On the nature and role of modal truth criteria in planning. Artificial Intelligence, 82(2).Google Scholar
[312] and (1995). Universal classical planner: An algorithm for unifying state-space and plan-space planning. In Proc. European Conf. on Planning (ECP).
[313] and (2005). Aheuristic search algorithm for solving first-order MDPs. In Proc. Conf. on Uncertainty in AI (UAI), pp. 292–299.Google Scholar
[314] and (2012). Sampling-based algorithms for optimal motion planning with deterministic μ-calculus specifications. In American Control Conference (ACC), pp. 735–742. IEEE.Google Scholar
[315] , , , , and (2008). To secure an anchor –Arecovery planning approach to ambiguity in perceptual anchoring. AI Communincations, 21(1):1–14.Google Scholar
[316] and (2009). Cost-optimal planning with landmarks. In Proc. IJCAI, pp. 1728–1733.Google Scholar
[317] , , , and (2015). Temporal landmarks: What must happen, and when. In Proc. ICAPS.
[318] and (2008). Optimal additive composition of abstraction-based admissible heuristics. In Proc. ICAPS, pp. 174–181.Google Scholar
[319] and (2009). Structural-pattern databases. In Proc. ICAPS.
[320] and (1986). Generalized plan recognition. In Proc. AAAI, pp. 32–37.
[321] , , and (1996). Encoding plans in propositional logic. In Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp. 374–384.
[322] and (1992). Planning as satisfiability. In Proc. ECAI.
[323] and (1996). Pushing the envelope: Planning, propositional logic, and stochastic search. In Proc. AAAI, pp. 1194–1201.Google Scholar
[324] , , and , editors (2006). Synthesis and Planning, Dagstuhl Seminar Proceedings.
[325] , , and (2002). A sparse sampling algorithm for near-optimal planning in large Markov decision processes. Machine Learning, 49:193–208.Google Scholar
[326] and (1992). Automatically synthesising domain constraints from operator descriptions. In Proc. ECAI, pp. 653–655.Google Scholar
[327] and (2012). PROST: Probabilistic planning based on UCT. Proc. ICAPS, pp. 119–127.Google Scholar
[328] , , , and (2001). Temporal constraint reasoning with preferences. In Proc. IJCAI.
[329] and (2007). Handbook of Robotics. Springer.
[330] and (2014). Planning under temporal uncertainty using hindsight optimization. In ICAPS Wksp. on Planning and Robotics, pp. 1–11.Google Scholar
[331] and (2009). Solving fully-observable non-deterministic planning problems via translation into a general game. In Proc. Annual German Conf. on AI (KI), pp. 1–8. Springer.Google Scholar
[332] , , , , and (2001). Casper: space exploration through continuous planning. IEEE Intelligent Systems, 16(5):70–75.Google Scholar
[333] (1992). An analysis of ABSTRIPS. In Proc.AIPS.
[334] (1994). Automatically generating abstractions for planning. Artificial Intelligence, 68(2):243–302.Google Scholar
[335] , , and (1991). Characterizing abstraction hierarchies for planning. In Proc. AAAI, pp. 692–698.Google Scholar
[336] and (1994). Evaluating the trade-offs in partial-order planning algorithms. In AAAI Wksp. on Comparative Analysis of AI Planning Systems.
[337] and (1995). Relating the performance of partial-order planning algorithms to domain features. SIGART Bulletin, 6(1).Google Scholar
[338] and (1975). An analysis of alpha-beta pruning. Artificial Intelligence, 6:293–326.Google Scholar
[339] and (2006). Bandit based Monte-Carlo planning. In Proc. European Conf. on Machine Learning (ECML), volume 4212 of LNAI, pp. 1–12. Springer.
[341] (1999). Handling of conditional effects and negative goals in IPP. Technical Report 128, Albert-Ludwigs-Universitat Freiburg.
[342] (2001). Minimax real-time heuristic search. Artificial Intelligence, 129(1–2):165–197.Google Scholar
[343] and (1998). Solving robot navigation problems with initial pose uncertainty using real-time heuristic search. In Proc. AIPS.
[344] and (1995). Real-time search in non-deterministic domains. In Proc. IJCAI, pp. 1660–1669.Google Scholar
[345] and (2009). Probabilistic Graphical Models: Principles and Techniques. MIT Press.
[346] , , and (2010). SixthSense: Fast and reliable recognition of dead ends in MDPs. In Proc. AAAI.
[347] , , and (2012). Stochastic shortest path MDPs with dead ends. Proc. ICAPS Workshop HSDIP.
[348] , , , and (2011). Heuristic search for generalized stochastic shortest path MDPs. In Proc. ICAPS.
[349] and (2009). ReTrASE: integrating paradigms for approximate probabilistic planning. In Proc. IJCAI.
[351] (1985). Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence, 27:97–109.Google Scholar
[352] (1987). Planning as search: A quantitative approach. Artificial Intelligence, 33:65–88.Google Scholar
[354] (1997). From local to global consistency in temporal constraint networks. Theoretical Computer Science, 173(1):89–112.Google Scholar
[355] , , , and (2007). The meaning of action: a review on action recognition and mapping. Advanced Robotics, 21(13):1473–1501.Google Scholar
[356] and (1983a). The composite decision process:A unifying formulation for heuristic search, dynamic programming and branch and bound procedures. In Proc. AAAI, pp. 220–224.Google Scholar
[357] and (1983b). Ageneral branch and bound formulation for understanding and synthesizing and/or tree search procedures. Artificial Intelligence, pp. 179–198.Google Scholar
[358] , , , and (2000). Open systems in reactive environments: Control and synthesis. In Proc. Intl. Conf. on Concurrency Theory (CONCUR), pp. 92–107.Google Scholar
[359] and (2001). Synthesizing distributed systems. In IEEE Symp. on Logic in Computer Sci., pp. 389–398.Google Scholar
[360] and (2007). Ellipsoidal techniques for reachability analysis of discrete-time linear systems. IEEE Trans. Automat. Contr., 52(1):26–38.Google Scholar
[361] and (2005). Using domain-configurable search control for probabilistic planning. In Proc. AAAI, pp. 1169–1174.Google Scholar
[362] , , , and (2005). A hierarchical task-network planner based on symbolic model checking. In Proc. ICAPS, pp. 300–309.Google Scholar
[363] , , , and (2009). Task decomposition on abstract states, for planning under nondeterminism. Artificial Intelligence, 173:669–695.Google Scholar
[364] , , , and (2008). Using classical planners to solve nondeterministic planning problems. In Proc. ICAPS, pp. 190–197.Google Scholar
[365] , , , , and (2004). Information gathering during planning for web service composition. In , , and , editors, Proc. Intl. Semantic Web Conf. (ISWC), volume 3298 of LNCS, pp. 335–349. Springer.Google Scholar
[366] and (2001). TALplanner:Atemporal logic based forward chaining planner. Annals of Mathematics and Artificial Intelligence, 30:119–169.Google Scholar
[367] , , and (2000). Extending TALplanner with concurrency and resources. In Proc. European Conf. on Planning (ECP).Google Scholar
[368] , , and (2006). Solving factored MDPs with hybrid state and action variables. J. Artificial Intelligence Research, 27:153–201.Google Scholar
[369] (2003). Algorithms for propagating resource constraints in ai planning and scheduling: Existing approaches and new results. Artificial Intelligence, 143(2):151–188.Google Scholar
[370] and (1995). Planning with sharable resource constraints. In Proc. IJCAI, pp. 1643–1649.Google Scholar
[371] , , and (2012). Universal Subgoaling and Chunking: The Automatic Generation and Learning of Goal Hierarchies, volume 11. Springer Science & Business Media.
[372] and (2006). Efficient discriminant viewpoint selection for active Bayesian recognition. Intl. J. Robotics Research, 68(3):267–287.Google Scholar
[373] and (1966). Branch-and-bound methods: A survey. Operations Research, 14(4):699–719.Google Scholar
[374] , , , , et al. (2008). Chronicles for on-line diagnosis of distributed systems. In Proc. ECAI, volume 8, pp. 194–198.Google Scholar
[375] and (2004). Interleaving temporal planning and execution in robotics domains. In Proc. AAAI.Google Scholar
[376] , , , , and (2010). ORO, a knowledge management platform for cognitive architectures in robotics. In IEEE/RSJ Intl. Conf. on Intelligent Robots and Syst. (IROS).Google Scholar
[377] , , , , and (1994). A logical approach to high-level robot programming – a progress report. In AAAI Fall Symp. on Control of the Physical World by Intelligent Agents. AAAI Technical Report FS-94-03.
[378] , , , , and (1997a). GOLOG: A logic programming language for dynamic domains. J. Logic Programming, 31:59–84.Google Scholar
[379] , , , , and (1997b). GOLOG: a logic programming language for dynamic domains. J. Logic Progr., 31:59–83.Google Scholar
[380] and (2014). Concurrent plan recognition and execution for human-robot teams. In Proc. ICAPS.Google Scholar
[381] and (2008). Generative planning for hybrid systems based on flow tubes. In Proc. ICAPS, pp. 206–213.Google Scholar
[382] , , , and (2010). Integrating preferences into goal models for requirements engineering. In Intl.Requirements Engg. Conf., pp. 135– 144.Google Scholar
[383] and (1999). Scalability in planning. In and , editors, Proc. European Conf. on Planning (ECP), volume 1809 of LNAI, pp. 49–61. Springer.
[384] (1987). On the semantics of STRIPS. In and , editors,Reasoning about Actions and Plans: Proc. 1986 Wksp., pp. 1–9. Morgan Kaufmann. Reprinted in [15], pp. 523–530.
[385] (1991).On generalized interval calculi. In Proc. AAAI, pp. 234–240.
[386] , , and (2004). Planning forMarkov decision processes with sparse stochasticity. In Adv. in Neural Information Processing Syst. (Proc. NIPS), volume 17.
[387] (1965). Computer solutions of the traveling salesman problem. Bell System Technical Journal, 44(10):2245–2269.Google Scholar
[388] , , and (2005). Prottle:A probabilistic temporal planner. In Proc. AAAI, pp. 1181–1186.Google Scholar
[389] and (2007). Probabilistic planning vs. replanning. In ICAPSWksp. on the Intl. Planning Competition.Google Scholar
[390] and (2006). Functional value iteration for decision-theoretic planning with general utility functions. In Proc. AAAI.Google Scholar
[391] , , , and (2012). A planning based framework for controlling hybrid systems. In Proc. ICAPS.Google Scholar
[392] , , , and (2013). Domain predictive control under uncertain numerical state information. In Proc. ICAPS.Google Scholar
[393] and (1999). Efficient implementation of the plan graph in STAN. J. Artificial Intelligence Research, 10(1–2):87–115.Google Scholar
[394] and (2003a). The 3rd international planning competition: Results and analysis. J. Artificial Intelligence Research, 20:1–59.Google Scholar
[395] and (2003b). Exploiting a graphplan framework in temporal planning. In Proc. ICAPS, pp. 52–61.Google Scholar
[396] and (2000). New advances in GraphHTN: Identifying independent subproblems in large HTN domains. In Proc. AIPS, pp. 206–215.Google Scholar
[397] , , and (1999). Using planning graphs for solving HTN problems. In Proc. AAAI, pp. 534–540.Google Scholar
[398] , , and (2012). Integration of online learning into HTN planning for robotic tasks. In AAAI Spring Symposium.Google Scholar
[399] , , , and (2014). Partially observable online contingent planning using landmark heuristics. In Proc. ICAPS.Google Scholar
[401] and (2016). Robot waiters: A case for hybrid reasoning with different types of knowledge. J. Experimental & Theoretical Artificial Intelligence.Google Scholar
[403] , , and (2008). Angelic hierarchical planning: Optimal and online algorithms. In Proc. ICAPS, pp. 222–231.Google Scholar
[404] , , , and (2005). Concurrent hierarchical reinforcement learning. In Proc. AAAI, p. 1652.Google Scholar
[405] , , , and (2010). Pattern database heuristics for fully observable nondeterministic planning. In Proc. ICAPS, pp. 105–112.Google Scholar
[406] , , and (2007). A hybridized planner for stochastic domains. In Proc. IJCAI, pp. 1972–1978.Google Scholar
[407] and (2012). Planning with Markov Decision Processes: An AI Perspective. Morgan & Claypool.
[409] and (2006). Probabilistic temporal planning with uncertain durations. In Proc. AAAI, pp. 880–887.Google Scholar
[410] and (2008). Planning with durative actions in stochastic domains. J. Artificial Intelligence Research, 31(1):33–82.Google Scholar
[412] (1990). Formalizing Common Sense: Papers by John McCarthy. Ablex Publishing.
[413] and (1969). Some philosophical problems from the standpoint of artificial intelligence. and , editors, Machine Intelligence 4, pp. 463– 502. Edinburgh Univ. Press. Reprinted in [412].
[414] (1982). A temporal logic for reasoning about processes and plans. Cognitive Science, 6:101–155.Google Scholar
[415] (1991). A reactive plan language.Technical Report YALEU/CSD/RR 864, Yale Univ.
[416] (2000). The 1998 AI planning systems competition. AI Magazine, 21(2):35.
[417] and (2002). Adapting GOLOG for composition of semantic web services. In Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp. 482–496.Google Scholar
[418] and (2005). Fast exact planning in Markov decision processes. In Proc. ICAPS, pp. 151–160.Google Scholar
[419] (1990). Faster Constraint satisfaction algorithms for temporal reasoning. Tech. report R-151, UC Los Angeles.
[420] , , , and (2009). A heuristic search approach to planning with continuous resources in stochastic domains. J. Artificial Intelligence Research, 34(1):27.Google Scholar
[421] and (2007). Hierarchical heuristic forward search in stochastic domains. In Proc. IJCAI, pp. 2542–2549.Google Scholar
[423] , , and (1991). Commitment strategies in planning: A comparative analysis. In Proc. IJCAI, pp. 259–265.Google Scholar
[424] , , , and (1992). Total order vs. partial order planning: Factors influencing performance. In Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp. 83–92.Google Scholar
[425] (1970). Branch and bound methods: General formulations and properties. Operations Research, 18:23–34.Google Scholar
[426] , , and (2006). A survey of advances in visionbased human motion capture and analysis. Computer Vision and Image Understanding, 104(2–3):90–126.Google Scholar
[427] (2011). On the modelling and optimization of preferences in constraintbased temporal reasoning. Artificial Intelligence, 175(7):1390–1409.
[428] and (2005). Partial constraint satisfaction of disjunctive temporal problems. In Proc. Intl. Florida AI Research Soc. Conf. (FLAIRS), pp. 715–720.
[429] , , and (2010). Goal-driven autonomy in a Navy strategy simulation. In Proc. AAAI, pp. 1548–1554.
[430] and (2002a). Learning how to combine sensory-motor modalities for a robust behavior. In , , , and , editors, Advances in Plan-based Control of Robotics Agents, volume 2466 of LNAI, pp. 157–178. Springer.
[431] and (2002b). Synthesis of supervision policies for robust sensorymotor behaviors. In Intl. Conf. on Intell. and Autonomous Syst. (IAS), pp. 236–243.Google Scholar
[432] (2014). Dynamic controllability and dispatchability relationships. In Integration of AI and OR, pp. 464–479.Google Scholar
[433] , , and (2001). Dynamic control of plans with temporal uncertainty. In Proc. IJCAI, pp. 494–502.Google Scholar
[434] and (2005). Temporal dynamic controllability revisited. In Proc. AAAI, pp. 1193–1198.Google Scholar
[435] , , and (2014). Non-deterministic planning with conditional effects. In Proc. ICAPS.
[436] , , and (2012). Improved non-deterministic planning by exploiting state relevance. In Proc. ICAPS.
[437] and (2002). Variable resolution discretization in optimal control. Machine Learning, 49:291–323.Google Scholar
[438] , , , , , and (2001). SiN: Integrating case-based reasoning with task decomposition. In Proc. IJCAI.
[439] , , , , and (2002). IDEA: Planning at the core of autonomous reactive agents. In Intl. Wksp. on Planning and Scheduling for Space (IWPSS).Google Scholar
[440] , , and (1998a). Reformulating temporal plans for efficient execution. In Principles of Knowledge Representation and Reasoning, pp. 444– 452.Google Scholar
[441] , , , and (1998b). Remote Agent: To boldly go where no AI system has gone before. Artificial Intelligence, 103:5–47.Google Scholar
[442] (1999). CPEF:Acontinuous planning and execution framework. AI Magazine, 20(4):63–69.Google Scholar
[443] , , , , , , , and (2005). Constraints and AI planning. IEEE Intelligent Systems, 20(2):62–72.Google Scholar
[444] , , , , , , , and (2005). Applications of SHOP and SHOP2. IEEE Intelligent Systems, 20(2):34–41.Google Scholar
[445] , , , ,, , and (2003). SHOP2: An HTN planning system. J. Artificial Intelligence Research, 20:379–404.Google Scholar
[446] , , , and . (1999). SHOP: Simple hierarchical ordered planner. In Proc. IJCAI, pp. 968–973.Google Scholar
[447] , , and (1984). General branch and bound, and its relation to A* and AO*. Artificial Intelligence, 23(1):29–58.Google Scholar
[448] , , , , and (2001). Total-order planning with partially ordered subtasks. In Proc. IJCAI.
[449] and (1995). Reasoning about temporal relations:a maximal tractable subclass of Allen's interval algebra. J. ACM, 42(1):43–66.Google Scholar
[450] and (1965). The search for generality. In Proc. IFIP Congress, volume 65, pp. 17–24.Google Scholar
[451] and (1963). GPS, a program that simulates human thought. In and , editors, Computers and Thought. McGraw- Hill.Google Scholar
[452] , , , and (2007). Learning macro-actions for arbitrary planners and domains. In Proc. ICAPS.
[453] and (2000). PEGASUS: a policy search method for large MDPs and POMDPs. In Proc. Conf. on Uncertainty in AI (UAI), pp. 406–415.Google Scholar
[454] and (2001). Reviving partial order planning. In Proc. IJCAI.
[455] and (2003). Natural methods for robot task learning: instructive demonstrations, generalization and practice. In Proc. AAMAS, pp. 241– 248.Google Scholar
[456] , , and (2006). Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL (T). J. ACM, 53(6):937–977.Google Scholar
[457] and (2008). Route planning under uncertainty: The Canadian traveller problem. In Proc. AAAI, pp. 969–974.Google Scholar
[458] , , and (2014a). EfficientIDC: A faster incremental dynamic controllability algorithm. In Proc. ICAPS.
[459] , , and (2014b). Incremental dynamic controllability in cubic worst-case time. In Intl. Symp. on Temporal Representation and Reasoning.Google Scholar
[460] (1980). Principles of Artificial Intelligence. Morgan Kaufmann.
[461] and (2007). Bayesian rationality the probabilistic approach to human reasoning. Oxford Univ. Press.
[462] and (1996). Learning planning operators with conditional and probabilistic effects. In Proc.AAAI Spring Symposium on Planning with Incomplete Information for Robot Problems, pp. 86–94.Google Scholar
[463] , , , and (2010). Planning under uncertainty for robotic tasks with mixed observability. Intl. J. Robotics Research, 29(8):1053–1068.Google Scholar
[464] (1994). Computational Complexity. AddisonWesley.
[465] and (1998). Reinforcement learning with hierarchies of machines. In Adv. in Neural Information Processing Syst. (Proc.NIPS), pp. 1043–1049.Google Scholar
[466] , , and P. (2004). Learning probabilistic relational planning rules. In Proc. ICAPS, pp. 73–82.Google Scholar
[467] (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
[468] , , , , and (2012). A constraint-based approach for proactive, context-aware human support. J. Ambient Intell. and Smart Environments, 4(4):347–367.Google Scholar
[469] (1988). Synthesizing plans that contain actions with context-dependent effects. Computational Intelligence, 4:356–372.Google Scholar
[470] (1989). ADL:Exploring the middle ground between STRIPS and the situation calculus. In Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp. 324–332.Google Scholar
[471] and (1994). Temporal planning with continuous change. In Proc. AAAI, pp. 1010–1015.Google Scholar
[472] and (1992). UCPOP:A sound, complete, partial order planner for ADL. In Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR).Google Scholar
[473] , , , and (2009). Upmurphi: a tool for universal planning on PDDL+ problems. In Proc. ICAPS, pp. 19–23.Google Scholar
[476] and (2004). Extending the knowledge-based approach to planning with incomplete information and sensing. In Proc. ICAPS, pp. 2–11.Google Scholar
[477] (2005). Execution monitoring in robotics: A survey. Robotics and Autonomous Systems, 53(2):73–88.Google Scholar
[478] (1951). The Psychology of Intelligence. Routledge.
[479] (2001). Studies in Reflecting Abstraction. Psychology Press.
[480] , , and (2002). Policy-contingent abstraction for robust robot control. In Proc. Conf. on Uncertainty in AI (UAI), pp. 477–484.Google Scholar
[481] , , , , and (2003). Towards robotic assistants in nursing homes: Challenges and results. Robotics and Autonomous Systems, 42(3–4):271–281.Google Scholar
[482] , , and (2001). Symbolic techniques for planning with extended goals in non-deterministic domains. In Proc.European Conf.on Planning (ECP), LNAI. Springer.
[483] , , and (2006). A minimalist approach to semantic annotations for web processes compositions. In Euro. SemanticWebConf. (ESWC), pp. 620–634.Google Scholar
[484] and (2001). Planning as model checking for extended goals in nondeterministic domains. In Proc. IJCAI, pp. 479–484. Morgan Kaufmann.Google Scholar
[485] and (2007). Assumption-based composition and monitoring of web services. In Test and Analysis of Web Services, pp. 307–335. Springer.
[486] , , and (2005). Automated composition of web services by planning in asynchronous domains. In Proc. ICAPS, pp. 2–11.Google Scholar
[487] (2008). Incrementally solving the STP by enforcing partial path consistency. In Proc.Wksp. of theUKPlanning and Scheduling Special Interest Group (PlanSIG), pp. 87–94.Google Scholar
[488] and (1989a). On the synthesis of a reactive module. In Proc. ACM Conf. on Principles of Programming Languages, pp. 179–190.Google Scholar
[489] and (1989b). On the synthesis of an asynchronous reactive module. In Proc. Intl. Colloq. Automata, Langs. and Program. (ICALP), pp. 652–671.Google Scholar
[490] and (1990). Distributed reactive systems are hard to synthesize. In 31st Annual Symposium on Foundations of Computer Science, pp. 746–757.Google Scholar
[491] (1970). Heuristic search viewed as path finding in a graph. Artificial Intelligence, 1(3):193–204.Google Scholar
[492] and (1999). There's more to life than making plans: Plan management in dynamic, multiagent environments. AI Magazine, 20(4):1–14.Google Scholar
[493] , , and (2001). On the extraction, ordering, and usage of landmarks in planning. In Proc. European Conf. on Planning (ECP).
[494] , , and (2011). Active and interactive discovery of goal selection knowledge. In FLAIRS.Google Scholar
[495] and (2009). The belief roadmap: Efficient planning in belief space by factoring the covariance. IJRR, 28(11–12):1448–1465.Google Scholar
[496] and (1996). Planning for contingency: A decision based approach. J. Artificial Intelligence Research, 4:81–120.Google Scholar
[497] (1994). MarkovDecision Processes: Discrete StochasticDynamic Programming. Wiley.
[498] , , and (2010). A systematic agent framework for situated autonomous systems. In Proc. AAMAS, pp. 583–590.Google Scholar
[499] and (2000). Probabilistic state-dependent grammars for plan recognition. In Proc. Conf. on Uncertainty in AI (UAI), pp. 507–514.Google Scholar
[500] , , , and (2001). Application of ILP to cardiac arrhythmia characterization for chronicle recognition. In Inductive Logic Programming, pp. 220–227. Springer.Google Scholar
[501] , , , , and (1999). Iterative repair planning for spacecraft operations in the ASPEN system. In Intl. Symp. on Artificial Intell., Robotics and Automation in Space (i-SAIRAS).Google Scholar
[503] and (2012). T-REX: Partitioned inference for AUV mission control. In and , editors, Further Advances in Unmanned Marine Vehicles, pp. 171–199. The Institution of Engg. and Technology.Google Scholar
[504] , , and (2012). Towards deliberative control in marine robotics. In Marine Robot Autonomy, pp. 91–175. Springer.Google Scholar
[505] and (2010). Probabilistic plan recognition using off-the-shelf classical planners. In Proc. AAAI, pp. 1121–1126.Google Scholar
[506] , , and (2013). Behavior composition as fully observable non-deterministic planning. In Proc. ICAPS.
[507] and (2014). Directed fixed-point regression-based planning for non-deterministic domains. In Proc. ICAPS.Google Scholar
[508] , , and (1977). Combinatorial Optimization. PrenticeHall.
[510] and (2010). The LAMA planner: Guiding cost-based anytime planning with landmarks. J. Artificial Intelligence Research, 39(1):127–177.Google Scholar
[511] (1999). Constructing conditional plans by a theorem-prover. J. Artificial Intelligence Research, 10:323–352.Google Scholar
[512] (2000). An iterative algorithm for synthesizing invariants. In Proc. AAAI, pp. 1–6.Google Scholar
[513] (2002). Backward plan construction for planning as search in belief space. In Proc.AIPS.
[515] , , , and (2006). Ipss: A hybrid approach to planning and scheduling integration. IEEE Trans. Knowledge and Data Engg. (TDKE), 18(12):1681–1695.Google Scholar
[516] , , , and (2008). Online planning algorithms for POMDPs. J. Artificial Intelligence Research, 32:663–704.Google Scholar
[517] and (2009). Artificial Intelligence: A Modern Approach. Prentice- Hall.
[518] , , , and M. (2007). Interactive robot task training through dialog and demonstration. In Conference on Human-Robot Interaction, pp. 49–56.Google Scholar
[519] (1974). Planning in a hierarchy of abstraction spaces. Artificial Intelligence, 5:115–135.Google Scholar
[520] (1975). The nonlinear nature of plans. In Proc. IJCAI, pp. 206–214.Reprinted in [15], pp. 162–170.Google Scholar
[521] , , and (2012). Using theWeb to interactively learn to find objects. In Proc. AAAI, pp. 2074–2080.
[522] (2006). Foundations of multidimensional and metric data structures. Morgan Kauffmann.
[523] (1994). Features and Fluents: The Representation of Knowledge about Dynamical Systems. Oxford Univ. Press.
[525] (2010). Relational dynamic influence diagram language (RDDL): Language description. Technical report, NICTA.
[526] and (2014). Chance-constrained consistency for probabilistic temporal plan networks. In Proc. ICAPS.Google Scholar
[527] and (2012). On the use of non-stationary policies for stationary infinite-horizon Markov decision processes. In Adv. in Neural Information Processing Syst. (Proc. NIPS), pp. 1826–1834.Google Scholar
[528] and (1967). State functions and linear control systems. McGraw- Hill.
[529] , , , , , , and (2013). Knowledge engineering tools in planning: State-of-the-art and future challenges. In ICAPS Knowledge Engg. for Planning and Scheduling (KEPS), pp. 53–60.Google Scholar
[530] , , and (2012). A survey of point-based POMDP solvers. J. Autonomous Agents and Multi-Agent Syst., pp. 1–51.Google Scholar
[531] , , and (2006). Contingent planning with goal preferences. In Proc. AAAI, pp. 927–935.Google Scholar
[532] , , and (2008). Fusing procedural and declarative planning goals for nondeterministic domains. In Proc. AAAI, pp. 983–990.Google Scholar
[533] , , , and (2013). The GoDeL planning system: A more perfect union of domain-independent and hierarchical planning. In Proc. IJCAI, pp. 2380–2386.Google Scholar
[534] and (1988). Problems in formal temporal reasoning. Artificial Intelligence, 36:49–61.Google Scholar
[535] (1967). Mathematical Logic. Academic Press.
[536] (1987). Temporal logic in AI: semantical and ontological considerations. Artificial Intelligence, 33:89–104.Google Scholar
[537] and (2010). From Motor Learning to Interaction Learning in Robots, volume 264 of Studies in Computational Intelligence. Springer.
[538] and (2010). Monte-Carlo planning in large POMDPs. In Adv. in Neural Information Processing Syst. (Proc.NIPS).Google Scholar
[539] (1992). Concurrent planning and execution for autonomous robots. IEEE Control Systems, 12(1):46–50.Google Scholar
[540] (1994). Structured control for autonomous robots. IEEE Trans. Robotics and Automation, 10(1):34–43.Google Scholar
[541] and (1998). A task description language for robot control. In IEEE/RSJ Intl. Conf. on Intelligent Robots and Syst. (IROS), pp. 1931–1937.Google Scholar
[542] , , , and (2008). Towards adaptive programming: integrating reinforcement learning into a programming language. In Proc.ACMSIGPLANConf. on Object-Oriented Progr.Syst., Lang., and Applications (OOPSLA),pp. 603–614. ACM.Google Scholar
[543] , , and (2007). Planning domain definition using GIPO. The Knowledge Engineering Review, 22(2):117–134.Google Scholar
[544] , , , , and (2004). HTN planning for Web service composition using SHOP2. J.Web Semant. (JWS), 1(4):377–396.Google Scholar
[545] , , and (2008). The ANML language. ICAPS Wksp. on Knowledge Engg. for Planning and Scheduling (KEPS).Google Scholar
[546] , , and (2000). Bridging the gap between planning and scheduling. The Knowledge Engineering Review, 15(1):47–83.Google Scholar
[549] and (1999b). Temporal planning with mutual exclusion reasoning. In Proc. IJCAI, pp. 326–337.Google Scholar
[550] , , , and (1997). Integrating electrical and mechanical design and process planning. In Mantyla, M., Finger, S., and Tomiyama, T., editors, Knowledge Intensive CAD, pp. 269–288. Chapman and Hall.Google Scholar
[551] , ,and (1998). Computer bridge:Abig win for AI planning. AI Magazine, 19(2):93–105.Google Scholar
[552] and (2004). Heuristic search value iteration for POMDPs. In Proc. Conf. on Uncertainty in AI (UAI).Google Scholar
[554] and (2010). Preference-based web service composition:A middle ground between execution and search. In Proc. Intl. Semantic Web Conf. (ISWC), pp. 713–729. Springer.Google Scholar
[555] , , and (2008). HiPPo:Hierarchical POMDPsfor planning information processing and sensing actions on a robot. In Proc. ICAPS, pp. 346–354.Google Scholar
[556] (2000). Realplan:Decoupling causal and resource reasoning in planning. In Proc. AAAI, pp. 812–818.Google Scholar
[557] and (2005). A fast incremental dynamic controllability algorithm. In Proc. ICAPS Wksp. on Plan Execution.Google Scholar
[558] and (2008). Refining the execution of abstract actions with learned action models. J. Artificial Intelligence Research, 32(1):487–523.Google Scholar
[559] (1975). Integer Programming: Theory, Applications, and Computations. Academic Press.
[560] (1972). Depth-first search and linear graph algorithms. SIAM J. Computing, 1(2):146–160.Google Scholar
[562] , , and (1994). O-Plan2: An Architecture for Command, Planning and Control. Morgan-Kaufmann.
[563] , , , , , and (2011). Pure reasoning in 12-month-old infants as probabilistic inference. Science, 332(6033):1054–1059.Google Scholar
[564] (2012a). Fast incremental policy compilation from plans in hybrid probabilistic domains. In Proc. ICAPS.Google Scholar
[565] (2012b). Stochastic safest and shortest path problems. In Proc. AAAI, pp. 1825–1831.Google Scholar
[566] , , and (2008). RFF:Arobust, FF-based MDP planning algorithm for generating policies with low probability of failure. In Proc. ICAPS.Google Scholar
[567] , , and (2010). Incremental plan aggregation for generating policies in MDPs. In Proc. AAMAS, pp. 1231–1238.Google Scholar
[568] , , and (2011). Extending classical planning heuristics to probabilistic planning with dead-ends. In Proc. AAAI, pp. 1–6.Google Scholar
[569] and (2013). KnowRob: A knowledge processing infrastructure for cognition-enabled robots. Intl. J. Robotics Research, 32(5):566–590.Google Scholar
[570] , , and , editors (2000). AIPS Wksp. on Model- Theoretic Approaches to Planning.
[571] , , and (2005). Reviving integer programming approaches for AI planning:A branch-and-cut framework. In Proc. ICAPS, pp. 310–319.Google Scholar
[572] , , and (2008). Loosely coupled formulations for automated planning:An integer programming perspective. J. Artificial Intelligence Research, 31:217–257.Google Scholar
[573] , , , and (2007). itSIMPLE 2.0: An integrated tool for designing planning domains. In Proc. ICAPS, pp. 336–343.Google Scholar
[574] , , and (2011). A brief review of tools and methods for knowledge engineering for planning & scheduling. In ICAPS Knowledge Engg. for Planning and Scheduling (KEPS), pp. 7–15.Google Scholar
[575] (1995). An automata-theoretic approach to fair realizability and synthesis. In Proc. Intl. Conf. on Computer Aided Verification, pp. 267–278.Google Scholar
[576] (2008). From verification to synthesis. In Proc. Intl. Conf. on Verified Software: Theories, Tools, Experiments.
[577] , , , and (2013). Breadth of approaches to goal reasoning:A research survey. In ACS Wksp. on Goal Reasoning.Google Scholar
[578] , , , , and (2011). Planning to perceive: Exploiting mobility for robust object detection. In Proc. ICAPS.Google Scholar
[579] and (1995). FLECS: planning with a flexible commitment strategy. J. Artificial Intelligence Research, 3:25–52.Google Scholar
[580] and (1998). Mapping planning actions and partially-ordered plans into execution knowledge. In Wksp. on Integrating Planning, Scheduling and Execution in Dynamic and Uncertain Environments, pp. 94–97.Google Scholar
[581] (1983). Planning in time: Windows and duration for activities and goals. IEEE Trans. Pattern Analysis and Machine Intell., 5(3):246–264.Google Scholar
[582] , , and (2010). How to model planning and scheduling problems using timelines. The Knowledge Engineering Review, 25:319–336.Google Scholar
[583] , , , , , and (2005). Plan execution interchange language (PLEXIL) for executable plans and command sequences. In Intl. Symp. on Artificial Intell., Robotics and Automation in Space (i-SAIRAS).Google Scholar
[584] , , and (2013). Problem splitting using heuristic search in landmark orderings. In Proc. IJCAI, pp. 2401–2407. AAAI Press.Google Scholar
[585] (2007). A hierarchically-layered multiplayer bot system for a first-person shooter. Master's thesis, Vrije Universiteit of Amsterdam.
[586] and (1999). Handling contingency in temporal constraint networks: from consistency to controllabilities. J. Experimental & Theoretical Artificial Intelligence.
[587] and (1996). Dealing with uncertain durations in temporal constraints networks dedicated to planning. In ECAI, pp. 48–52.Google Scholar
[588] and (1986). Constraint propagation algorithms for temporal reasoning. In Proc. AAAI, pp. 377–382.Google Scholar
[589] , , and (1989). Constraint propagation algorithms for temporal reasoning: a revised report. In de and , editors, Readings in Qualitative Reasoning about Physical Systems. Morgan-Kaufmann.
[590] and (2010). Visual design of planning domains. In Wksp. on Knowledge Engg. for Planning and Scheduling (KEPS), pp. 68–69.Google Scholar
[591] , , and (2003). Automatic video interpretation: A novel algorithm for temporal scenario recognition. In Proc. IJCAI, pp. 1295–1300.Google Scholar
[592] , , , D'Andrea|R., , , , , , , , , , and (2011). RoboEarth. IEEE Robotics and Automation Magazine, 18(2):69–82.Google Scholar
[593] (1977). Achieving several goals simultaneously. In Machine Intelligence 8, pp. 94–138. Halstead and Wiley. Reprinted in [15], pp. 118–139.Google Scholar
[594] and (2008). Efficient learning of action schemas and Web-service descriptions. In Proc. AAAI.Google Scholar
[595] , , , and (1991). A Petri-net coordination model for an intelligent mobile robot. IEEE Trans. Syst., Man, and Cybernetics, 21(4):777–789.Google Scholar
[596] (1976). Generating conditional plans and programs. In Proc. Summer Conf. on Artificial Intelligence and Simulation of Behaviour.Google Scholar
[597] , , and (2002). Shaping of hooks in New Caledonian crows. Science, 297(5583):981.Google Scholar
[600] , , and (1998). Extending Graphplan to handle uncertainty and sensing actions. In Proc. AAAI, pp. 897–904.Google Scholar
[601] and (1994). The first law of robotics (a call to arms). In Proc. AAAI, pp. 1042–1047.Google Scholar
[602] (2000). Using the SIPE-2 planning system:A manual for version 6.1. Technical report, SRI International.
[604] (1988). Practical Planning: Extending the Classical AI Planning Paradigm. Morgan Kaufmann.
[605] and (1995). A common knowledge representation for plan generation and reactive execution. J. Logic and Computation, 5(6):731–761.
[606] and (2001). Executing reactive, model-based programs through graph-based temporal planning. In Proc. IJCAI.Google Scholar
[607] and (1996). Amodel-based approach to reactive self-configuring systems. In Proc. AAAI, pp. 971–978.Google Scholar
[608] , , and (2012). A bayesian approach for policy learning from trajectory preference queries. In Adv. in Neural Information Processing Syst. (Proc. NIPS), pp. 1142–1150.Google Scholar
[609] and (2005). Prioritization methods for accelerating MDP solvers. J. Machine Learning Research, 6:851–881.Google Scholar
[610] (1999). Philosophical Investigations. Prentice Hall.
[611] , , , , and (2011). TuLiP:a software toolbox for receding horizon temporal logic planning. In 14th Intl. Conf. on Hybrid Syst.: Computation and Control, pp. 313–314.ACM.Google Scholar
[612] and (1999). Vision-based gesture recognition:A review. In , , , , and , editors, Gesture-Based Communication in Human-Computer Interaction, pp. 103–115. Springer.
[613] , , and (2015). Understanding and improving local exploration for gbfs. In Proc. ICAPS.Google Scholar
[614] , , and (2007). Discriminative learning of beam-search heuristics for planning. In Proc. IJCAI.Google Scholar
[615] (1990). Formalizing planning knowledge for hierarchical planning. Computational Intelligence, 6(1):12–24.Google Scholar
[616] (1997). Intelligent Planning: A Decomposition and Abstraction Based Approach. Springer.
[617] , , and (2007). Learning action models from plan examples using weighted MAX-SAT. Artificial Intelligence, 171(2):107–143.Google Scholar
[618] , , and (2006). Learning heuristic functions from relaxed plans. In Proc. ICAPS.Google Scholar
[619] , , and (2007). FF-replan:Abaseline for probabilistic planning. In Proc. ICAPS, pp. 352–359.Google Scholar
[620] , , , and (2008). Probabilistic planning via determinization in hindsight. In Proc. AAAI.Google Scholar
[621] and (2004). PPDDL: The probabilistic planning domain definition language. Technical report,CMU.
[622] and (2002). On the role of ground actions in refinement planning. In Proc. AIPS, pp. 54–62.Google Scholar
[623] and (2003). VHPOP: Versatile heuristic partial order planner. J. Artificial Intelligence Research.Google Scholar
[624] and (2004). Solving generalized semi-Markov decision processes using continuous phase-type distributions. In Proc. AAAI, pp. 742–747.Google Scholar
[625] (1999). State-space search: Algorithms, complexity, extensions, and applications. Springer Science & Business Media.
[626] , , , , and (2009). Learning HTN method preconditions and action models from partial observations. In Proc. IJCAI, pp. 1804–1810.Google Scholar
[627] , , , and (2010). Learning complex action models with quantifiers and logical implications. Artificial Intelligence, 174(18):1540–1569.Google Scholar
[628] and (2003). Learning-assisted automated planning: Looking back, taking stock, going forward. AI Magazine, 24(2):73.Google Scholar
[629] , , L, , and (2011). Petri net plans. J. Autonomous Agents and Multi-Agent Syst., 23(3):344–383.