M. Aarup, M. M. Arentoft, Y. Parrod, J. Stader, and I. Stokes, , 1994.

O. , A knowledge-based planning and scheduling system for spacecraft AIV, Intelligent Scheduling, pp.451-469

P. Abbeel, A. Coates, and A. Ng, Autonomous helicopter aerobatics through apprenticeship learning, Intl. J. Robotics Research, vol.29, issue.13, pp.1608-1639, 2010.

P. Abbeel and A. Y. Ng, Inverse reinforcement learning, Encyclopedia of Machine Learning, pp.554-558, 2010.

T. Abdul-razaq and C. Potts, Dynamic programming state-space relaxation for single-machine scheduling, J. Operational Research Soc, pp.141-152, 1988.

S. Adali, L. Console, M. L. Sapino, M. Schenone, and P. Terenziani, Representing and reasoning with temporal constraints in multimedia presentations, Intl. Symp. on Temporal Representation and Reasoning (TIME), pp.3-12, 2000.

J. M. Agosta, Formulation and implementation of an equipment configuration problem with the SIPE-2 generative planner, AAAI-95 Spring Symp. on Integrated Planning Applications, pp.1-10, 1995.

A. Albore and P. Bertoli, Generating safe assumption-based plans for partially observable, nondeterministic domains, Proc. AAAI, pp.495-500, 2004.

R. Alford, U. Kuter, and D. S. Nau, Translating HTNs to PDDL: A small amount of domain knowledge can go a long way, Proc. IJCAI, 2009.

R. Alford, U. Kuter, D. S. Nau, and R. P. Goldman, Plan aggregation for strong cyclic planning in nondeterministic domains, Artificial Intelligence, vol.216, pp.206-232, 2014.

R. Alford, V. Shivashankar, U. Kuter, and D. S. Nau, On the feasibility of planning graph style heuristics for HTN planning, Proc. ICAPS. Bibliography, 2014.

J. Allen, Towards a general theory of action and time, Artificial Intelligence, vol.23, pp.123-154, 1984.

J. Allen, J. Allen, H. Kautz, R. Pelavin, and J. Tenenberg, Temporal reasoning and planning, Reasoning about Plans, pp.1-68, 1991.

J. F. Allen, Maintaining knowledge about temporal intervals, Communications ACM, vol.21, issue.11, pp.832-843, 1983.

J. F. Allen, Planning as temporal reasoning, Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), 1991.

J. F. Allen, J. Hendler, T. , and A. , Readings in Planning, 1990.

J. F. Allen and J. A. Koomen, Planning using a temporal world model, Proc. IJCAI, 1983.

J. L. Ambite, C. A. Knoblock, and S. Minton, Learning plan rewriting rules, Proc. ICAPS, 2000.

J. A. Ambros-ingerson and S. Steel, Integrating planning, execution and monitoring, Proc. AAAI, pp.21-26, 1988.

J. R. Anderson, D. Bothell, M. D. Byrne, S. Douglass, C. Lebiere et al., An integrated theory of the mind, Psychological Review, vol.111, issue.4, pp.1036-1060, 2004.

D. Andre, N. Friedman, and R. Parr, Generalized prioritized sweeping, Adv. in Neural Information Processing Syst. (Proc. NIPS), 1997.

D. Andre and S. J. Russell, State abstraction for programmable reinforcement learning agents, Proc. AAAI, 2002.

T. Andrews, F. Curbera, H. Dolakia, J. Goland, J. Klein et al., Business Process Execution Language for Web Services, 2003.

M. Araya-lopez, V. Thomas, O. Buffet, C. , and F. , A closer look at MOMDPs, IEEE Intl. Conf. on Tools with AI (ICTAI), pp.197-204, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00535559

B. D. Argall, S. Chernova, M. M. Veloso, and B. Browning, A survey of robot learning from demonstration, Robotics and Autonomous Systems, vol.57, issue.5, pp.469-483, 2009.

K. J. Aström, Optimal control of Markov decision processes with incomplete state estimation, J. Math. Analysis and Applications, vol.10, pp.174-205, 1965.

I. Awaad, G. K. Kraetzschmar, and J. Hertzberg, Finding ways to get the job done: An affordance-based approach, Proc. ICAPS, 2014.

F. Baader, D. Calvanese, D. Mcguinness, D. Nardi, and P. Schneider, The Description Logic Handbook: Theory, Implementation and Applications, 2003.

F. Bacchus and F. Kabanza, Using temporal logics to express search control knowledge for planning, Artificial Intelligence, vol.116, issue.1-2, pp.123-191, 2000.

C. Bäckström, Planning in polynomial time: The SAS-PUB class, Computational Intelligence, vol.7, pp.181-197, 1991.

C. Bäckström and B. Nebel, Complexity results for SAS+ planning, Proc. IJCAI, 1993.

C. Bäckström and B. Nebel, Complexity results for SAS+ planning, Computational Intelligence, vol.11, issue.4, pp.1-34, 1995.

J. A. Baier, B. Mombourquette, and S. Mcilraith, Diagnostic problem solving: a planning perspective, Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp.1-10, 2014.

E. Balas, A note on the branch-and-bound principle, Operations Research, vol.16, pp.442-444, 1968.

M. Ball and R. C. Holte, The compression power of symbolic pattern databases, Proc. ICAPS, pp.2-11, 2008.

P. Baptiste, P. Laborie, C. Le-pape, and W. Nuijten, Constraintbased scheduling and planning, Handbook of constraint programming, vol.22, pp.759-798, 2006.

M. Barbier, J. Gabard, J. H. Llareus, and C. Tessier, Implementation and flight testing of an onboard architecture for mission supervision, Intl. Unmanned Air Vehicle Syst. Conf, 2006.

J. Barreiro, M. Boyce, J. Frank, M. Iatauro, T. Kichkaylo et al., EUROPA: A platform for AI planning, scheduling, constraint programming, and optimization, Intl. Competition on Knowledge Engg. for Planning and Scheduling (ICKEPS), 2012.

A. Barrett, K. Golden, J. S. Penberthy, and D. S. Weld, UCPOP user's manual (version 2.0), 1993.

A. Barrett and D. S. Weld, Characterizing subgoal interactions for planning, Proc. IJCAI, pp.1388-1393, 1993.

A. Barrett and D. S. Weld, Partial order planning: Evaluating possible efficiency gains, Artificial Intelligence, vol.67, issue.1, pp.71-112, 1994.

C. Barrett, A. Stump, and C. Tinelli, The SMT-LIB standard: Version 2.0, 8th Intl. Wksp. on Satisfiability Modulo Theories, 2010.

J. Barry, L. P. Kaelbling, and T. Lozano-perez, Hierarchical solution of large Markov decision processes, ICAPS Workshop, pp.1-8, 2010.

J. Barry, L. P. Kaelbling, and T. Lozano-perez, DetH*: Approximate hierarchical solution of large Markov decision processes, Proc. IJCAI, pp.1-8, 2011.

R. Barták, R. Morris, and B. Venable, An Introduction to ConstraintBased Temporal Reasoning, 2014.

R. Barták, M. A. Salido, and F. Rossi, Constraint satisfaction techniques in planning and scheduling, J. Intelligent Manufacturing, vol.21, issue.1, pp.5-15, 2010.

A. G. Barto, S. J. Bradke, and S. P. Singh, Learning to act using real-time dynamic-programming, Artificial Intelligence, vol.72, pp.81-138, 1995.

M. Beetz, Structured reactive controllers: Controlling robots that perform everyday activity, Proc. Annual Conf. on Autonomous Agents, pp.228-235, 1999.

M. Beetz and D. Mcdermott, Declarative goals in reactive plans, Proc. AIPS, p.3, 1992.

M. Beetz and D. Mcdermott, Improving robot plans during their execution, Proc. AIPS, 1994.

R. Bellman, Dynamic Programming, 1957.

K. Ben-lamine and F. Kabanza, Reasoning about robot actions: a model checking approach, Advances in Plan-Based Control of Robotic Agents, pp.123-139, 2002.

P. Bercher, S. Keen, and S. Biundo, Hybrid planning heuristics based on task decomposition graphs. International Symposium on Combinatorial Search (SoCS), pp.1-9, 2014.

D. Bernard, E. Gamble, N. Rouquette, B. Smith, Y. Tung et al., Remote agent experiment DS1 technology validation report, 2000.

G. Bernardi, A. Cesta, A. Orlandini, and A. Finzi, A knowledge engineering environment for P&S with timelines, Proc. ICAPS, pp.16-23, 2013.

S. Bernardini and D. Smith, Finding mutual exclusion invariants in temporal planning domains, Intl. Wksp. on Planning and Scheduling for Space (IWPSS), 2011.

S. Bernardini and D. E. Smith, Developing domain-independent search control for Europa2, ICAPS Wksp. on Heuristics for Domain-Independent Planning, 2007.

S. Bernardini and D. E. Smith, Automatically generated heuristic guidance for Europa2, Intl. Symp. on Artificial Intell., Robotics and Automation in Space (i-SAIRAS), 2008.

S. Bernardini and D. E. Smith, Towards search control via dependency graphs in Europa2, ICAPS Wksp. on Heuristics for Domain-Independent Planning, 2009.

P. Bertoli, A. Cimatti, M. Pistore, M. Roveri, and P. Traverso, MBP: a model based planner, IJCAI Wksp. on Planning under Uncertainty and Incomplete Information, pp.93-97, 2001.

P. Bertoli, A. Cimatti, M. Pistore, and P. Traverso, A framework for planning with extended goals under partial observability, Proc. ICAPS, 2003.

P. Bertoli, A. Cimatti, M. Roveri, and P. Traverso, Planning in nondeterministic domains under partial observability via symbolic model checking, Proc. IJCAI, pp.473-478, 2001.

P. Bertoli, A. Cimatti, M. Roveri, and P. Traverso, Strong planning under partial observability, Artificial Intelligence, vol.170, issue.4, pp.337-384, 2006.

P. Bertoli, A. Cimatti, and P. Traverso, Interleaving execution and planning for nondeterministic, partially observable domains, Proc. ECAI, pp.657-661, 2004.

P. Bertoli, M. Pistore, and P. Traverso, Automated composition of Web services via planning in asynchronous domains, Artificial Intelligence, vol.174, issue.3-4, pp.316-361, 2010.

D. Bertsekas, Dynamic Programming and Optimal Control, Athena Scientific, 2001.

D. Bertsekas and J. Tsitsiklis, Neuro-Dynamic Programming, Athena Scientific, 1996.

D. P. Bertsekas and J. N. Tsitsiklis, An analysis of stochastics shortest path problems, Mathematics of Operations Research, vol.16, issue.3, pp.580-595, 1991.

C. Betz and M. Helmert, Planning with h + in theory and practice, Proc. Annual German Conf. on AI (KI), vol.5803, 2009.

A. Bhatia, L. E. Kavraki, and M. Y. Vardi, Sampling-based motion planning with temporal goals, IEEE Intl. Conf. on Robotics and Automation (ICRA), pp.2689-2696, 2010.

C. D. Bird and N. J. Emery, Insightful problem solving and creative tool modification by captive nontool-using rooks, Proc. Natl. Acad. of Sci, vol.106, pp.10370-10375, 2009.

C. D. Bird and N. J. Emery, Rooks use stones to raise the water level to reach a floating worm, Current Biology, vol.19, issue.16, pp.1410-1414, 2009.

S. Biundo and B. Schattenberg, From abstract crisis to concrete relief-A preliminary report on combining state abstraction and HTN planning, Proc. European Conf. on Planning (ECP), pp.157-168, 2001.

A. Blum and J. Langford, Probabilistic planning in the graphplan framework, Proc. European Conf. on Planning (ECP), pp.319-322, 1999.

A. L. Blum and M. L. Furst, Fast planning through planning graph analysis, Artificial Intelligence, vol.90, issue.1-2, pp.281-300, 1997.

M. Boddy and T. Dean, Solving time-dependent planning problems, Proc. IJCAI, pp.979-984, 1989.

F. Boese and J. Piotrowski, Autonomously controlled storage management in vehicle logistics applications of RFID and mobile computing systems, Intl. J. RF Technologies: Research and Applications, vol.1, issue.1, pp.57-76, 2009.

S. Bogomolov, D. Magazzeni, S. Minopoli, W. , and M. , PDDL+ planning with hybrid automata: Foundations of translating must behavior, Proc. ICAPS, pp.42-46, 2015.

S. Bogomolov, D. Magazzeni, A. Podelski, W. , and M. , Planning as model checking in hybrid domains, Proc. AAAI, pp.2228-2234, 2014.

J. Bohren, R. B. Rusu, E. G. Jones, E. Marder-eppstein, C. Pantofaru et al., Towards autonomous robotic butlers: Lessons learned with the PR2, IEEE Intl. Conf. on Robotics and Automation (ICRA), pp.5568-5575, 2011.

B. Bonet, On the speed of convergence of value iteration on stochastic shortest-path problems, Mathematics of Operations Research, vol.32, issue.2, pp.365-373, 2007.

B. Bonet and H. Geffner, Planning with incomplete information as heuristic search in belief space, Proc. AIPS, pp.52-61, 2000.

B. Bonet and H. Geffner, Planning as heuristic search, Artificial Intelligence, vol.129, pp.5-33, 2001.

B. Bonet and H. Geffner, Faster heuristic search algorithms for planning with uncertainty and full feedback, Proc. IJCAI, 2003.

B. Bonet and H. Geffner, Labeled RTDP: Improving the convergence of real-time dynamic programming, Proc. ICAPS, pp.12-21, 2003.

B. Bonet and H. Geffner, mGPT: A probabilistic planner based on heuristic search, J. Artificial Intelligence Research, vol.24, pp.933-944, 2005.

B. Bonet and H. Geffner, Learning in depth-first search: A unified approach to heuristic search in deterministic, non-deterministic, probabilistic, and game tree settings, Proc. ICAPS, pp.142-151, 2006.

B. Bonet and H. Geffner, Solving POMDPs: RTDP-Bel vs. pointbased algorithms, Proc. IJCAI, pp.1641-1646, 2009.

B. Bonet and H. Geffner, Action selection for MDPs: Anytime AO* versus UCT, Proc. AAAI, 2012.

B. Bonet and H. Geffner, Belief tracking for planning with sensing: Width, complexity and approximations, J. Artificial Intelligence Research, vol.50, pp.923-970, 2014.

B. Bonet and M. Helmert, Strengthening landmark heuristics via hitting sets, Proc. ECAI, pp.329-334, 2010.

A. Bouguerra, L. Karlsson, and A. Saffiotti, Semantic knowledgebased execution monitoring for mobile robots, IEEE Intl. Conf. on Robotics and Automation (ICRA), pp.3693-3698, 2007.

C. Boutilier, R. I. Brafman, G. , and C. , Structured reachability analysis for Markov decision processes, Proc. Conf. on Uncertainty in AI (UAI), pp.24-32, 1998.

C. Boutilier, T. Dean, and S. Hanks, Decision-theoretic planning: Structural assumptions and computational leverage, J. Artificial Intelligence Research, vol.11, pp.1-94, 1999.

C. Boutilier, R. Dearden, G. , and M. , Stochastic dynamic programming with factored representations, Artificial Intelligence, vol.121, pp.49-107, 2000.

J. A. Boyan and M. L. Littman, Exact solutions to time dependent MDPs, Adv. in Neural Information Processing Syst. (Proc. NIPS), pp.1026-1032, 2001.

R. Brafman and J. Hoffmann, Conformant planning via heuristic forward search: A new approach, Proc. ICAPS, 2004.

M. Brenner and B. Nebel, Continual planning and acting in dynamic multiagent environments, J. Autonomous Agents and Multi-Agent Syst, vol.19, issue.3, pp.297-331, 2009.

V. Brusoni, L. Console, P. Terenziani, and D. T. Dupre, A spectrum of definitions for temporal model-based diagnosis, Artificial Intelligence, vol.102, issue.1, pp.39-79, 1998.

V. Brusoni, L. Console, P. Terenziani, P. , and B. , Qualitative and quantitative temporal constraints and relational databases: Theory, architecture, and applications, IEEE trans. on KDE, vol.11, issue.6, pp.948-968, 1999.

A. Bucchiarone, A. Marconi, M. Pistore, R. , and H. , Dynamic adaptation of fragment-based and context-aware business processes, Intl. Conf. on Web Services, pp.33-41, 2012.

A. Bucchiarone, A. Marconi, M. Pistore, P. Traverso, P. Bertoli et al., Domain objects for continuous context-aware adaptation of service-based systems, In ICWS, pp.571-578, 2013.

O. Buffet and O. Sigaud, Markov Decision Processes in Artificial Intelligence, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00432735

L. Busoniu, R. Munos, . De, B. Schutter, and R. Babuska, Optimistic planning for sparsely stochastic systems, IEEE Symp. on Adaptive Dynamic Progr. and Reinforcement Learning, pp.48-55, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00830125

T. Bylander, Complexity results for extended planning, Proc. AAAI, 1992.

T. Bylander, The computational complexity of propositional STRIPS planning, Artificial Intelligence, vol.69, pp.165-204, 1994.

D. Calvanese, G. D. Giacomo, and M. Y. Vardi, Reasoning about actions and planning in ltl action theories, Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp.593-602, 2002.

C. Castellini, E. Giunchiglia, and A. Tacchella, Improvements to SAT-based conformant planning, Proc. European Conf. on Planning (ECP), 2001.

C. Castellini, E. Giunchiglia, and A. Tacchella, SAT-based planning in complex domains: Concurrency, constraints and nondeterminism, Artificial Intellegence, vol.147, pp.85-118, 2003.

L. Castillo, J. Fdez-olivares, and O. Garcia-pérez, Efficiently handling temporal knowledge in an HTN planner, Proc. ICAPS, pp.1-10, 2006.

L. Castillo, J. Fdez-olivares, O. Garc?a-pérez, P. , and F. , Efficiently handling temporal knowledge in an HTN planner, Proc. ICAPS, pp.63-72, 2006.

A. Cesta and A. Oddi, Gaining efficiency and flexibility in the simple temporal problem, Intl. Symp. on Temporal Representation and Reasoning (TIME), 1996.

A. Cesta, A. Oddi, and S. F. Smith, A constraint-based method for project scheduling with time windows, J. Heuristics, vol.8, issue.1, pp.109-136, 2002.

A. Champandard, T. Verweij, and R. Straatman, The AI for Killzone 2's multiplayer bots, Game Developers Conf. (GDC), 2009.

D. Chapman, Planning for conjunctive goals, Artificial Intelligence, vol.32, pp.333-379, 1987.

R. Chatilla, R. Alami, B. Degallaix, L. , and H. , Integrated planning and execution control of autonomous robot actions, IEEE Intl. Conf. on Robotics and Automation (ICRA), pp.2689-2696, 1992.

L. Chrpa, Combining learning techniques for classical planning: Macro-operators and entanglements, IEEE Intl. Conf. on Tools with AI (ICTAI), vol.2, pp.79-86, 2010.

A. Cimatti, F. Giunchiglia, P. Pecchiari, B. Pietra, J. Profeta et al., A provably correct embedded verifier for the certification of safety critical software, Intl. Conf. on Computer Aided Verification (CAV), pp.202-213, 1997.

A. Cimatti, A. Micheli, R. , and M. , Solving temporal problems using SMT: Strong controllability, Proc. Int. Conf. Principles and Practice of Constraint Programming(CP), 2012.

A. Cimatti, A. Micheli, R. , and M. , Solving temporal problems using SMT: Weak controllability, Proc. AAAI, 2012.

A. Cimatti, A. Micheli, R. , and M. , Strong temporal planning with uncontrollable durations: A state-space approach, Proc. AAAI, pp.1-7, 2015.

A. Cimatti, M. Pistore, M. Roveri, and P. Traverso, Weak, strong, and strong cyclic planning via symbolic model checking, Artificial Intelligence, vol.147, issue.1-2, pp.35-84, 2003.

A. Cimatti, M. Roveri, and P. Traverso, Automatic OBDD-based generation of universal plans in non-deterministic domains, Proc. AAAI, pp.875-881, 1998.

A. Cimatti, M. Roveri, and P. Traverso, Strong planning in nondeterministic domains via model checking, Proc. AIPS, pp.36-43, 1998.

J. Claßen, G. Röger, G. Lakemeyer, and B. Nebel, Platasintegrating planning and the action language Golog, vol.26, pp.61-67, 2012.

A. Coates, P. Abbeel, and A. Ng, Apprenticeship learning for helicopter control, Communications ACM, vol.52, issue.7, p.97, 2009.

A. Coles and A. Smith, Marvin: a heuristic search planner with online macro-action learning, J. Artificial Intelligence Research, vol.28, pp.119-156, 2007.

A. I. Coles, M. Fox, D. Long, and A. J. Smith, Planning with problems requiring temporal coordination, Proc. AAAI, 2008.

A. J. Coles, A. Coles, M. Fox, L. , and D. , COLIN: planning with continuous linear numeric change, J. Artificial Intelligence Research, 2012.

P. Conrad, J. Shah, W. , and B. C. , Flexible execution of plans with choice, Proc. ICAPS, 2009.

S. Coradeschi and A. Saffiotti, Perceptual anchoring: a key concept for plan execution in embedded systems, Advances in Plan-Based Control of Robotic Agents, pp.89-105, 2002.

T. Cormen, C. Leirson, R. Rivest, and C. Stein, Introduction to Algorithms, 2001.

J. C. Culberson and J. Schaeffer, Pattern databases, vol.14, pp.318-334, 1998.

K. Currie and A. Tate, O-Plan: The open planning architecture, Artificial Intelligence, vol.52, issue.1, pp.49-86, 1991.

P. Dai and E. A. Hansen, Prioritizing Bellman backups without a priority queue, Proc. ICAPS, pp.113-119, 2007.

U. Dal-lago, M. Pistore, and P. Traverso, Planning with a language for extended goals, Proc. AAAI, pp.447-454, 2002.

M. Daniele, P. Traverso, and M. Vardi, Strong cyclic planning revisited, Proc. European Conf. on Planning (ECP), pp.35-48, 1999.

G. De-giacomo, L. Iocchi, D. Nardi, R. , and R. , Description logic-based framework for planning with sensing actions, Intl. Wksp. on Description Logics, 1997.

G. De-giacomo, L. Iocchi, D. Nardi, R. , and R. , A theory and implementation of cognitive mobile robots, J. Logic and Computation, vol.9, issue.5, pp.759-785, 1999.

G. De-giacomo, F. Patrizi, and S. Sardiña, Automatic behavior composition synthesis, Artificial Intelligence, 0196.

T. De-la-rosa and S. Mcilraith, Learning domain control knowledge for TLPlan and beyond, ICAPS Wksp. on Learning and Planning, 2011.

T. Dean, R. Firby, and D. Miller, Hierarchical planning involving deadlines, travel time and resources, Computational Intelligence, vol.6, issue.1, pp.381-398, 1988.

T. Dean, R. Givan, and S. Leach, Model reduction techniques for computing approximately optimal solutions for Markov decision processes, Proc. Conf. on Uncertainty in AI (UAI), pp.124-131, 1997.

T. Dean and K. Kanazawa, A model for reasoning about persistence and causation, Computational Intelligence, vol.5, issue.3, pp.142-150, 1989.

T. Dean and S. Lin, Decomposition techniques for planning in stochastic domains, Proc. IJCAI, pp.1121-1127, 1995.

T. Dean and D. Mcdermott, Temporal data base management, Artificial Intelligence, vol.32, issue.1, pp.1-55, 1987.

T. L. Dean and M. Wellman, Planning and Control, 1991.

R. Dechter, I. Meiri, P. , and J. , Temporal constraint networks, Artificial Intelligence, vol.49, pp.61-95, 1991.

M. P. Deisenroth, G. Neumann, and J. Peters, A survey on policy search for robotics, Foundations and Trends in Robotics, vol.2, issue.1-2, pp.1-142, 2013.

D. Penna, G. Magazzeni, D. Mercorio, F. Intrigila, and B. , UPMurphi: A tool for universal planning on PDDL+ problems, Proc. ICAPS, 2009.

D. Dennett, Kinds of Minds. Perseus, 1996.

C. Derman, Finite State Markovian Decision Processes, 1970.

O. Despouys and F. Ingrand, Propice-Plan: Toward a unified framework for planning and execution, Proc. European Conf. on Planning (ECP), 1999.

T. G. Dietterich, Hierarchical reinforcement learning with the maxq value function decomposition, J. Artificial Intelligence Research, vol.13, pp.227-303, 2000.

M. B. Do and S. Kambhampati, Sapa: A domain independent heuristic metric temporal planner, Proc. European Conf. on Planning (ECP), pp.109-121, 2001.

P. Doherty and J. Kvarnström, TALplanner: An empirical investigation of a temporal logic-based forward chaining planner, Intl. Symp. on Temporal Representation and Reasoning (TIME), pp.47-54, 1999.

P. Doherty and J. Kvarnström, TALplanner: A temporal logic based planner, AI Magazine, vol.22, issue.3, pp.95-102, 2001.

P. Doherty, J. Kvarnström, and F. Heintz, A temporal logic-based planning and execution monitoring framework for unmanned aircraft systems, J. Autonomous Agents and Multi-Agent Syst, vol.19, issue.3, pp.332-377, 2009.

P. Doherty, J. Kvarnström, and F. Heintz, A temporal logic-based planning and execution monitoring framework for unmanned aircraft systems, J. Autonomous Agents and Multi-Agent Syst, vol.19, issue.3, pp.332-377, 2009.

C. Domshlak, E. Karpas, and S. Markovitch, Online speedup learning for optimal planning, J. Artificial Intelligence Research, 2012.

J. E. Doran and D. Michie, Experiments with the graph traverser program, Proc. Royal Soc. A: Math., Phys., and Engr. Sci, vol.294, pp.235-259, 1437.

R. C. Dorf and R. H. Bishop, Modern Control Systems, 2010.

C. Dousson, P. Gaborit, G. , and M. , Situation recognition: Representation and algorithms, Proc. IJCAI, pp.166-172, 1993.

C. Dousson, L. Maigat, and P. , Chronicle recognition improvement using temporal focusing and hierarchization, Proc. IJCAI, pp.324-329, 2007.

T. Drakengren and P. Jonsson, Eight maximal tractable subclasses of Allen's algebra with metric time, J. Artificial Intelligence Research, vol.7, pp.25-45, 1997.

F. Dvorak, A. Bit-monnot, F. Ingrand, G. , and M. , A flexible ANML actor and planner in robotics, ICAPS Wksp. on Planning and Robotics, pp.12-19, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01138111

J. H. Eaton and L. A. Zadeh, Optimal pursuit strategies in discrete state probabilistic systems, Trans. ASME, vol.84, pp.23-29, 1962.

S. Edelkamp, Planning with pattern databases, Proc. European Conf. on Planning (ECP), 2001.

S. Edelkamp, Symbolic pattern databases in heuristic search planning, Proc. AIPS, pp.274-283, 2002.

S. Edelkamp, Taming numbers and durations in the model checking integrated planning system, J. Artificial Intelligence Research, vol.20, pp.195-238, 2003.

S. Edelkamp and M. Helmert, Exhibiting knowledge in planning problems to minimize state encoding length, Proc. European Conf. on Planning (ECP), volume 1809 of LNAI, pp.135-147, 1999.

S. Edelkamp and M. Helmert, On the implementation of MIPS, AIPS Wksp. on Model-Theoretic Approaches to Planning, pp.18-25, 2000.

S. Edelkamp and P. Kissmann, Optimal symbolic planning with action costs and preferences, Proc. IJCAI, pp.1690-1695, 2009.

S. Edelkamp, P. Kissmann, R. , and M. , Symbolic and explicit search hybrid through perfect hash functions-A case study in Connect Four, Proc. ICAPS, 2014.

S. Edelkamp, P. Kissmann, and ´. A. Torralba, BDDs strike back (in AI planning), Proc. AAAI, pp.4320-4321, 2015.

R. Effinger, B. Williams, and A. Hofmann, Dynamic execution of temporally and spatially flexible reactive programs, AAAI Wksp. on Bridging the Gap between Task and Motion Planning, pp.1-8, 2010.

A. El-kholy and B. Richard, Temporal and resource reasoning in planning: the ParcPlan approach, Proc. ECAI, pp.614-618, 1996.

M. Elkawkagy, P. Bercher, B. Schattenberg, and S. Biundo, Improving hierarchical planning performance by the use of landmarks, Proc. AAAI, 2012.

E. A. Emerson, Temporal and modal logic, Volume B: Formal Models and Semantics, pp.995-1072, 1990.

K. Erol, J. Hendler, and D. S. Nau, HTN planning: Complexity and expressivity, Proc. AAAI, 1994.

K. Erol, J. Hendler, and D. S. Nau, Semantics for hierarchical task-network planning, 1994.

K. Erol, J. Hendler, and D. S. Nau, UMCP: A sound and complete procedure for hierarchical task-network planning, Proc. AIPS, pp.249-254, 1994.

K. Erol, D. S. Nau, and V. S. Subrahmanian, Complexity, decidability and undecidability results for domain-independent planning, Artificial Intelligence, vol.76, issue.1-2, pp.75-88, 1995.

T. A. Estlin, S. Chien, W. , and X. , An argument for a hybrid HTN/operator-based approach to planning, Proc. European Conf. on Planning (ECP), pp.184-196, 1997.

O. Etzioni, S. Hanks, D. S. Weld, D. Draper, N. Lesh et al., An approach to planning with incomplete information, Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp.115-125, 1992.

P. Eyerich, R. Mattmuller, R. , and G. , Using the contextenhanced additive heuristic for temporal and numeric planning, Proc. ICAPS, 2009.

P. Eyerich, R. Mattmüller, G. ;. Röger, M. Zöllner, R. Bischoff et al., Using the contextenhanced additive heuristic for temporal and numeric planning, Towards Service Robots for Everyday Environments: Recent Advances in Designing Service Robots for Complex Tasks in Everyday Environments, pp.49-64, 2012.

H. Fargier, M. Jourdan, N. Layaa, and T. Vidal, Using temporal constraint networks to manage temporal scenario of multimedia documents, ECAI Wksp. on Spatial and Temporal Reasoning, 1998.

Z. Feng, R. Dearden, N. Meuleau, W. , and R. , Dynamic programming for structured continuous Markov decision problems, Proc. AAAI, pp.154-161, 2004.

Z. Feng and E. A. Hansen, Symbolic heuristic search for factored Markov decision processes, Proc. AAAI, pp.455-460, 2002.

Z. Feng, E. A. Hansen, and S. Zilberstein, Symbolic generalization for on-line planning, Proc. Conf. on Uncertainty in AI (UAI), pp.209-216, 2002.

D. I. Ferguson and A. Stentz, Focussed propagation of MDPs for path planning, IEEE Intl. Conf. on Tools with AI (ICTAI), pp.310-317, 2004.

F. Fernández and M. M. Veloso, Probabilistic policy reuse in a reinforcement learning agent, Proc. AAMAS, pp.720-727, 2006.

P. Ferraris and E. Giunchiglia, Planning as satisfiability in nondeterministic domains, Proc. AAAI, 2000.

A. Ferrein and G. Lakemeyer, Logic-based robot control in highly dynamic domains, Robotics and Autonomous Systems, vol.56, issue.11, pp.980-991, 2008.
DOI : 10.1016/j.robot.2008.08.010

M. Fichtner, A. Großmann, and M. Thielscher, Intelligent execution monitoring in dynamic environments, Fundamenta Informaticae, vol.57, issue.2-4, pp.371-392, 2003.

R. E. Fikes, Monitored execution of robot plans produced by STRIPS, IFIP Congress, 1971.

R. E. Fikes and N. J. Nilsson, STRIPS: A new approach to the application of theorem proving to problem solving, Artificial Intelligence, vol.2, issue.3, pp.189-208, 1971.

A. Finzi, F. Pirri, and R. Reiter, Open world planning in the situation calculus, Proc. AAAI, pp.754-760, 2000.

R. J. Firby, An investigation into reactive planning in complex domains, Proc. AAAI, pp.202-206, 1987.

M. Fisher, D. M. Gabbay, and L. Vila, Handbook of Temporal Reasoning in Artificial Intelligence, 2005.

A. Foka and P. Trahanias, Real-time hierarchical POMDPs for autonomous robot navigation, Robotics and Autonomous Systems, vol.55, pp.561-571, 2007.
DOI : 10.1016/j.robot.2007.01.004
URL : http://www.ics.forth.gr/cvrl/publications/journals/RAS_Published.pdf

J. P. Forestier and P. Varaiya, Multilayer control of large Markov chains, IEEE Trans. Automation and Control, vol.23, pp.298-304, 1978.
DOI : 10.1109/tac.1978.1101707

M. Fox and D. Long, Utilizing automatically inferred invariants in graph construction and search, Proc. ICAPS, pp.102-111, 2000.

M. Fox and D. Long, PDDL2.1: An extension to PDDL for expressing temporal planning domains, J. Artificial Intelligence Research, vol.20, pp.61-124, 2003.

M. Fox and D. Long, Modelling mixed discrete-continuous domains for planning, J. Artificial Intelligence Research, vol.27, pp.235-297, 2006.
DOI : 10.1613/jair.2044
URL : https://jair.org/index.php/jair/article/download/10471/25096

J. Frank and A. K. Jónsson, Constraint-based attribute and interval planning, Constraints, vol.8, issue.4, 2003.

G. Fraser, G. Steinbauer, and F. Wotawa, Plan execution in dynamic environments, Proc. Intl. Cognitive Robotics Workshop, pp.208-217, 2004.
DOI : 10.1007/11504894_30

S. Fratini, A. Cesta, R. De-benedictis, A. Orlandini, R. et al., APSI-based deliberation in goal oriented autonomous controllers, Symp. on Adv. in Space Technologies in Robotics and Automation (ASTRA), 2011.

J. Fu, V. Ng, F. B. Bastani, Y. , and I. , Simple and fast strong cyclic planning for fully-observable nondeterministic planning problems, Proc. IJCAI, pp.1949-1954, 2011.
DOI : 10.1007/s10472-016-9517-7

F. Fusier, V. Valentin, F. Bremond, M. Thonnat, M. Borg et al., Video understanding for complex activity recognition. Machine Vision and Applications, vol.18, pp.167-188, 2007.
DOI : 10.1007/s00138-006-0054-y
URL : https://hal.archives-ouvertes.fr/inria-00276936

C. E. Garcia, D. M. Prett, and M. Morari, Model predictive control: theory and practice-a survey, Automatica, vol.25, issue.3, pp.335-348, 1989.

F. Garcia and P. Laborie, Hierarchisation of the search space in temporal planning, European Wksp. on Planning (EWSP), pp.235-249, 1995.

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

A. Garrido, A temporal plannnig system for level 3 durative actions of PDDL2.1, AIPS Wksp. on Planning for Temporal Domains, pp.56-66, 2002.

H. Geffner, Functional Strips: A more flexible language for planning and problem solving, pp.187-209, 2000.

H. Geffner, PDDL 2.1: Representation vs. computation, J. Artificial Intelligence Research, vol.20, pp.139-144, 2003.

H. Geffner and B. Bonet, A Concise Introduction to Models and Methods for Automated Planning, 2013.

C. Geib and R. P. Goldman, A probabilistic plan recognition algorithm based on plan tree grammars, Artificial Intelligence, vol.173, pp.1101-1132, 2009.

S. Gelly and D. Silver, Combining online and offline knowledge in UCT, Proc. Intl. Conf. on Machine Learning (ICML), pp.273-280, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00164003

A. Gerevini, U. Kuter, D. S. Nau, A. Saetti, and N. Waisbrot, Combining domain-independent planning and HTN planning: The Duet planner, Proc. ECAI, pp.573-577, 2008.

A. Gerevini, A. Saetti, S. , and I. , Planning through stochastic local search and temporal action graphs in LPG, J. Artificial Intelligence Research, vol.20, pp.239-290, 2003.

A. Gerevini, A. Saetti, S. , and I. , Integrating planning and temporal reasoning for domains with durations and time windows, Proc. IJCAI, vol.19, pp.1226-1232, 2005.

A. Gerevini and L. Schubert, Accelerating partial-order planners: Some techniques for effective search control and pruning, J. Artificial Intelligence Research, vol.5, pp.95-137, 1996.

A. Gerevini and L. Schubert, Discovering state constraints in DISCOPLAN: Some new results, Proc. AAAI, 2000.

A. Gerevini and I. Serina, LPG: A planner based on local search for planning graphs, Proc. AIPS, pp.968-973, 2002.

M. Ghallab, On chronicles: Representation, on-line recognition and learning, Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp.597-606, 1996.

M. Ghallab, R. Alami, C. , and R. , Dealing with time in planning and execution monitoring, Intl. Symp. on Robotics Research (ISRR), pp.431-443, 1987.
URL : https://hal.archives-ouvertes.fr/hal-01979793

M. Ghallab and H. Laruelle, Representation and control in IxTeT, a temporal planner, Proc. AIPS, pp.61-67, 1994.

M. Ghallab and A. Mounir-alaoui, Managing efficiently temporal relations through indexed spanning trees, Proc. IJCAI, pp.1297-1303, 1989.

M. Ghallab, D. Nau, and P. Traverso, The actor's view of automated planning and acting: A position paper, Artificial Intelligence, vol.208, pp.1-17, 2014.

M. Ghallab, D. S. Nau, and P. Traverso, Automated Planning: Theory and Practice, 2004.
URL : https://hal.archives-ouvertes.fr/hal-01982019

Y. Gil, Description logics and planning, 2005.

J. L. Gischer, The equational theory of pomsets, Theoretical Computer Science, vol.61, issue.2, pp.199-224, 1988.

E. Giunchiglia, Planning as satisfiability with expressive action languages: Concurrency, constraints and nondeterminism, Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp.657-666, 2000.

F. Giunchiglia, Using Abstrips abstractions-where do we stand?, AI Review, vol.13, issue.3, pp.201-213, 1999.

F. Giunchiglia and P. Traverso, Planning as model checking, Proc. European Conf. on Planning (ECP), pp.1-20, 1999.

R. Givan, T. Dean, G. , and M. , Equivalence notions and model minimization in Markov decision processes, Artificial Intelligence, vol.142, pp.163-223, 2003.

K. Golden, O. Etzioni, and D. Weld, Omnipotence without omniscience: Efficient sensor management for planning, Proc. AAAI, pp.1048-154, 1994.

R. Goldman, M. Pelican, and D. Musliner, Hard real-time mode logic synthesis for hybrid control: A CIRCA-based approach, Hybrid Systems and AI: Papers from the AAAI Spring Symp. AAAI, 1999.

R. P. Goldman, D. J. Musliner, K. D. Krebsbach, and M. S. Boddy, Dynamic abstraction planning, Proc. AAAI, pp.680-686, 1997.

R. P. Goldman, D. J. Musliner, and M. J. Pelican, Using model checking to plan hard real-time controllers, AIPS Wksp. on Model-Theoretic Approaches to Planning, 2000.

M. Golumbic and R. Shamir, Complexity and algorithms for reasoning about time: a graph-theoretic approach, J. ACM, vol.40, issue.5, pp.1108-1133, 1993.

A. González-ferrer, J. Fernández-olivares, and L. Castillo, JABBAH: a java application framework for the translation between business process models and HTN, Proc. Intl. Competition on Knowledge Engineering for Planning and Scheduling (ICKEPS), 2009.

M. Gopal, Control Systems: Principles and Design, 1963.

P. Gregory, D. Long, F. , and M. , A meta-CSP model for optimal planning, Abstraction, Reformulation, and Approximation, pp.200-214, 2007.

P. Gregory, D. Long, M. Fox, and J. C. Beck, Planning modulo theories: Extending the planning paradigm, Proc. ICAPS, 2012.

T. Gruber, Ontology. In Encyclopedia of Database Systems, pp.1963-1965, 2009.

C. Guestrin, M. Hauskrecht, K. , and B. , Solving factored MDPs with continuous and discrete variables, Proc. Conf. on Uncertainty in AI (UAI), pp.235-242, 2004.

C. Guestrin, D. Koller, R. Parr, and S. Venkataraman, Efficient solution algorithms for factored MDPs, J. Artificial Intelligence Research, vol.19, pp.399-468, 2003.

A. Guez and J. Pineau, Multi-tasking SLAM, IEEE Intl. Conf. on Robotics and Automation (ICRA), pp.377-384, 2010.

D. Hähnel, W. Burgard, and G. Lakemeyer, GOLEX-bridging the gap between logic (GOLOG) and a real robot, Proc. Annual German Conf. on AI (KI), pp.165-176, 1998.

S. Hanks and R. J. Firby, Issues and architectures for planning and execution, Proc. Wksp. on Innovative Approaches to Planning, Scheduling and Control, pp.59-70, 1990.

E. A. Hansen, Suboptimality bounds for stochastic shortest path problems, Proc. Conf. on Uncertainty in AI (UAI), pp.301-310, 2011.

E. A. Hansen and S. Zilberstein, LAO*: A heuristic search algorithm that finds solutions with loops, Artificial Intelligence, vol.129, issue.1, pp.35-62, 2001.

P. E. Hart, N. J. Nilsson, R. , and B. , A formal basis for the heuristic determination of minimum cost paths, IEEE Trans. Syst., Man, and Cybernetics, pp.1556-1562, 1968.

P. E. Hart, N. J. Nilsson, R. , and B. , Correction to a formal basis for the heuristic determination of minimum cost paths, ACM SIGART Bulletin, vol.37, pp.28-29, 1972.

R. Hartanto and J. Hertzberg, Fusing DL reasoning with HTN planning, Proc. Annual German Conf. on AI (KI), pp.62-69, 2008.

P. Haslum, Admissible makespan estimates for PDDL2.1 temporal planning, ICAPS Wksp. on Heuristics for Domain-Independent Planning, 2009.

P. Haslum, B. Bonet, and H. Geffner, New admissible heuristics for domain-independent planning, Proc. AAAI, 2005.

P. Haslum, A. Botea, M. Helmert, B. Bonet, and S. Koenig, , 2007.

, Domain-independent construction of pattern database heuristics for cost-optimal planning, Proc. AAAI, vol.7, pp.1007-1012

P. Haslum and H. Geffner, Admissible heuristics for optimal planning, Proc. AIPS, pp.140-149, 2000.

P. Haslum and H. Geffner, Heuristic plannnig with time and resources, Proc. European Conf. on Planning (ECP), pp.121-132, 2001.

M. Hauskrecht, N. Meuleau, L. P. Kaelbling, T. Dean, and C. Boutilier, Hierarchical solution of Markov decision processes using macro-actions, Proc. Conf. on Uncertainty in AI (UAI), pp.220-229, 1998.

N. Hawes, A survey of motivation frameworks for intelligent systems, Artificial Intelligence, vol.175, issue.5, pp.1020-1036, 2011.

F. Heintz, J. Kvarnström, and P. Doherty, Bridging the sensereasoning gap: DyKnow-stream-based middleware for knowledge processing, Advanced Engineering Informatics, vol.24, issue.1, pp.14-26, 2010.

M. Helmert, A planning heuristic based on causal graph analysis, Proc. ICAPS, 2004.

M. Helmert, The Fast Downward planning system, J. Artificial Intelligence Research, vol.26, pp.191-246, 2006.

M. Helmert, Concise finite-domain representations for PDDL planning tasks, Artificial Intelligence, vol.173, issue.5, pp.503-535, 2009.

M. Helmert and C. Domshlak, Landmarks, critical paths and abstractions: What's the difference anyway?, Proc. ICAPS, pp.162-169, 2009.

M. Helmert and H. Geffner, Unifying the causal graph and additive heuristics, Proc. ICAPS, pp.140-147, 2008.

M. Helmert, P. Haslum, and J. Hoffmann, Flexible abstraction heuristics for optimal sequential planning, Proc. ICAPS, pp.176-183, 2007.

M. Helmert, P. Haslum, and J. Hoffmann, Explicit-state abstraction: A new method for generating heuristic functions, Proc. AAAI, pp.1547-1550, 2008.

M. Helmert, P. Haslum, J. Hoffmann, and R. Nissim, Merge-andshrink abstraction: A method for generating lower bounds in factored state spaces, J. ACM, vol.61, issue.3, p.16, 2014.

T. A. Henzinger, The theory of hybrid automata, In IEEE Symp. on Logic in Computer Sci, pp.278-292, 1996.

J. Hoey, R. St-aubin, A. Hu, and C. Boutilier, SPUDD: Stochastic planning using decision diagrams, Proc. Conf. on Uncertainty in AI (UAI), pp.279-288, 1999.

J. Hoffmann, FF: The Fast-Forward planning system, AI Magazine, vol.22, issue.3, pp.57-62, 2001.

J. Hoffmann, The metric-FF planning system: Translating "ignoring delete lists" to numeric state variables, J. Artificial Intelligence Research, vol.20, pp.291-341, 2003.

J. Hoffmann, Where "ignoring delete lists" works: local search topology in planning benchmarks, J. Artificial Intelligence Research, pp.685-758, 2005.

J. Hoffmann and R. Brafman, Contingent planning via heuristic forward search with implicit belief states, Proc. ICAPS, 2005.

J. Hoffmann and B. Nebel, The FF planning system: Fast plan generation through heuristic search, J. Artificial Intelligence Research, vol.14, pp.253-302, 2001.

J. Hoffmann, J. Porteous, and L. Sebastia, Ordered landmarks in planning, J. Artificial Intelligence Research, vol.22, pp.215-278, 2004.

A. G. Hofmann and B. C. Williams, Exploiting spatial and temporal flexibility for exploiting spatial and temporal flexibility for plan execution of hybrid, under-actuated systems, Cognitive Robotics, 2010.

C. Hogg, U. Kuter, and H. Muñoz-avila, Learning methods to generate good plans: Integrating HTN learning and reinforcement learning, Proc. AAAI, 2010.

S. Hongeng, R. Nevatia, and F. Bremond, Video-based event recognition: activity representation and probabilistic recognition methods, Computer Vision and Image Understanding, vol.96, issue.2, pp.129-162, 2004.
DOI : 10.1016/j.cviu.2004.02.005

J. N. Hooker, Operations research methods in constraint programming, Handbook of Constraint Programming, pp.527-570, 2006.

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, 2006.

S. S. Horowitz and S. Rajasakaran, Computer Algorithms, 1996.

R. A. Howard, Dynamic Probabilistic Systems, 1971.

R. Huang, Y. Chen, and W. Zhang, An optimal temporally expressive planner: Initial results and application to P2P network optimization, Proc. ICAPS, 2009.

T. Ibaraki, Theoretical comparision of search strategies in branch and bound, International Journal of Computer and Information Sciences, vol.5, pp.315-344, 1976.

, ICAPS competitions, p.16, 2015.

M. D. Ingham, R. J. Ragno, W. , and B. C. , A reactive modelbased programming language for robotic space explorers, Intl. Symp. on Artificial Intell., Robotics and Automation in Space (i-SAIRAS), 2001.

F. Ingrand, R. Chatilla, R. Alami, R. , and F. , PRS: A high level supervision and control language for autonomous mobile robots, IEEE Intl. Conf. on Robotics and Automation (ICRA), pp.43-49, 1996.
URL : https://hal.archives-ouvertes.fr/hal-01972550

F. Ingrand and M. Ghallab, Deliberation for Autonomous Robots: A Survey, Artificial Intelligence, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01137921

F. Ivankovic, P. Haslum, S. Thiebaux, V. Shivashankar, and D. Nau, Optimal planning with global numerical state constraints, Proc. ICAPS, 2014.

M. Iwen and A. D. Mali, Distributed graphplan, IEEE Intl. Conf. on Tools with AI (ICTAI), pp.138-145, 2002.

R. Jensen and M. Veloso, OBDD-based universal planning for synchronized agents in non-deterministic domains, J. Artificial Intelligence Research, vol.13, pp.189-226, 2000.

R. Jensen, M. Veloso, B. , and R. , Guided symbolic universal planning, Proc. ICAPS, 2003.

R. M. Jensen, M. M. Veloso, and M. H. Bowling, OBDD-based optimistic and strong cyclic adversarial planning, Proc. European Conf. on Planning (ECP), 2001.

S. Jiménez, T. De-la-rosa, S. Fernández, F. Fernández, and D. Borrajo, A review of machine learning for automated planning, The Knowledge Engg. Review, vol.27, issue.4, pp.433-467, 2012.

A. K. Jónsson, P. H. Morris, N. Muscettola, K. Rajan, and B. D. Smith, Planning in interplanetary space: Theory and practice, AIPS, pp.177-186, 2000.

P. Jonsson, T. Drakengren, and C. Bäckström, Computational complexity of relating time points and intervals, Artificial Intelligence, vol.109, pp.273-295, 1999.

K. Judah, A. P. Fern, and T. G. Dietterich, Active imitation learning via reduction to IID active learning, Proc. Conf. on Uncertainty in AI (UAI), pp.428-437, 2012.

F. Kabanza, M. Barbeau, and R. St-denis, Planning control rules for reactive agents, Artificial Intelligence, vol.95, issue.1, pp.67-113, 1997.

L. P. Kaelbling, M. L. Littman, C. , and A. , Planning and acting in partially observable stochastic domains, Artificial Intelligence, vol.101, pp.99-134, 1998.

S. Kambhampati, On the utility of systematicity: Understanding the trade-offs between redundancy and commitment in partial-order planning, Proc. IJCAI, pp.1380-1385, 1993.

S. Kambhampati, A comparative analysis of partial order planning and task reduction planning, SIGART Bulletin, vol.6, issue.1, 1995.

S. Kambhampati, Are we comparing Dana and Fahiem or SHOP and TLPlan? A critique of the knowledge-based planning track at ICP, 2003.

S. Kambhampati and J. A. Hendler, A validation-structure-based theory of plan modification and reuse, Artificial Intelligence, vol.55, pp.193-258, 1992.

S. Kambhampati, C. A. Knoblock, Y. , and Q. , Planning as refinement search: A unified framework for evaluating design tradeoffs in partial-order planning, Artificial Intelligence, vol.76, issue.1-2, pp.167-238, 1995.

S. Kambhampati and D. S. Nau, On the nature and role of modal truth criteria in planning, Artificial Intelligence, vol.82, issue.2, 1996.

S. Kambhampati and B. Srivastava, Universal classical planner: An algorithm for unifying state-space and plan-space planning, Proc. European Conf. on Planning (ECP), 1995.

E. Karabaev and O. Skvortsova, A heuristic search algorithm for solving first-order MDPs, Proc. Conf. on Uncertainty in AI (UAI), pp.292-299, 2005.

S. Karaman and E. Frazzoli, Sampling-based algorithms for optimal motion planning with deterministic µ-calculus specifications, American Control Conference (ACC), pp.735-742, 2012.

L. Karlsson, A. Bouguerra, M. Broxvall, S. Coradeschi, and A. Saffiotti, To secure an anchor-A recovery planning approach to ambiguity in perceptual anchoring, AI Communincations, vol.21, issue.1, pp.1-14, 2008.

E. Karpas and C. Domshlak, Cost-optimal planning with landmarks, Proc. IJCAI, pp.1728-1733, 2009.

E. Karpas, D. Wang, B. C. Williams, and P. Haslum, Temporal landmarks: What must happen, and when, Proc. ICAPS, 2015.

M. Katz and C. Domshlak, Optimal additive composition of abstraction-based admissible heuristics, Proc. ICAPS, pp.174-181, 2008.

M. Katz and C. Domshlak, Structural-pattern databases, Proc. ICAPS, 2009.

H. Kautz and J. Allen, Generalized plan recognition, Proc. AAAI, pp.32-37, 1986.

H. Kautz, D. Mcallester, and B. Selman, Encoding plans in propositional logic, Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp.374-384, 1996.

H. Kautz and B. Selman, Planning as satisfiability, Proc. ECAI, 1992.

H. Kautz and B. Selman, Pushing the envelope: Planning, propositional logic, and stochastic search, Proc. AAAI, pp.1194-1201, 1996.

H. A. Kautz, W. Thomas, and M. Y. Vardi, Synthesis and Planning, 2006.

M. Kearns, Y. Mansour, and A. Ng, A sparse sampling algorithm for near-optimal planning in large Markov decision processes, Machine Learning, vol.49, pp.193-208, 2002.

G. Kelleher and A. G. Cohn, Automatically synthesising domain constraints from operator descriptions, Proc. ECAI, pp.653-655, 1992.

T. Keller and P. Eyerich, PROST: Probabilistic planning based on UCT, Proc. ICAPS, pp.119-127, 2012.

L. Khatib, P. Morris, R. Morris, and F. Rossi, Temporal constraint reasoning with preferences, Proc. IJCAI, 2001.

S. Khatib and B. Siciliano, Handbook of Robotics, 2007.

S. Kiesel and W. Ruml, Planning under temporal uncertainty using hindsight optimization, ICAPS Wksp. on Planning and Robotics, pp.1-11, 2014.

P. Kissmann and S. Edelkamp, Solving fully-observable nondeterministic planning problems via translation into a general game, Proc. Annual German Conf. on AI (KI), pp.1-8, 2009.

R. Knight, G. Rabideau, S. Chien, B. Engelhardt, S. et al., Casper: space exploration through continuous planning, IEEE Intelligent Systems, vol.16, issue.5, pp.70-75, 2001.

C. Knoblock, An analysis of ABSTRIPS, Proc. AIPS, 1992.

C. A. Knoblock, Automatically generating abstractions for planning, Artificial Intelligence, vol.68, issue.2, pp.243-302, 1994.

C. A. Knoblock, J. D. Tenenberg, Y. , and Q. , Characterizing abstraction hierarchies for planning, Proc. AAAI, pp.692-698, 1991.

C. A. Knoblock, Y. , and Q. , Evaluating the trade-offs in partialorder planning algorithms, AAAI Wksp. on Comparative Analysis of AI Planning Systems, 1994.

C. A. Knoblock, Y. , and Q. , Relating the performance of partialorder planning algorithms to domain features, SIGART Bulletin, vol.6, issue.1, 1995.

D. E. Knuth and R. W. Moore, An analysis of alpha-beta pruning, Artificial Intelligence, vol.6, pp.293-326, 1975.

L. Kocsis and C. Szepesvári, Bandit based Monte-Carlo planning, Proc. European Conf. on Machine Learning (ECML), vol.4212, pp.1-12, 2006.

J. Koehler, Planning under resource constraints, Proc. ECAI, pp.489-493, 1998.

J. Koehler, Handling of conditional effects and negative goals in IPP, 1999.

S. Koenig, Minimax real-time heuristic search, Artificial Intelligence, vol.129, issue.1-2, pp.165-197, 2001.

S. Koenig and R. Simmons, Solving robot navigation problems with initial pose uncertainty using real-time heuristic search, Proc. AIPS, 1998.

S. Koenig and R. G. Simmons, Real-time search in non-deterministic domains, Proc. IJCAI, pp.1660-1669, 1995.

D. Koller and N. Friedman, Probabilistic Graphical Models: Principles and Techniques, 2009.

A. Kolobov, . Mausam, and D. Weld, SixthSense: Fast and reliable recognition of dead ends in MDPs, Proc. AAAI, 2010.

A. Kolobov, . Mausam, and D. Weld, Stochastic shortest path MDPs with dead ends, Proc. ICAPS Workshop HSDIP, 2012.

A. Kolobov, . Mausam, D. Weld, and H. Geffner, Heuristic search for generalized stochastic shortest path MDPs, Proc. ICAPS, 2011.

A. Kolobov and D. Weld, ReTrASE: integrating paradigms for approximate probabilistic planning, Proc. IJCAI, 2009.

R. Korf, Real-time heuristic search, Artificial Intelligence, vol.42, issue.23, pp.189-211, 1990.

R. E. Korf, Depth-first iterative-deepening: an optimal admissible tree search, Artificial Intelligence, vol.27, pp.97-109, 1985.

R. E. Korf, Planning as search: A quantitative approach, Artificial Intelligence, vol.33, pp.65-88, 1987.

R. E. Korf, Linear-space best-first search, Artificial Intelligence, vol.62, issue.1, pp.41-78, 1993.
DOI : 10.1016/0004-3702(93)90045-d

M. Koubarakis, From local to global consistency in temporal constraint networks, Theoretical Computer Science, vol.173, issue.1, pp.89-112, 1997.
DOI : 10.1007/3-540-60299-2_4

V. Krüger, D. Kragic, A. Ude, G. , and C. , The meaning of action: a review on action recognition and mapping, Advanced Robotics, vol.21, issue.13, pp.1473-1501, 2007.

V. Kumar and L. Kanal, The composite decision process: A unifying formulation for heuristic search, dynamic programming and branch and bound procedures, Proc. AAAI, pp.220-224, 1983.
DOI : 10.1007/978-1-4613-8788-6_1

V. Kumar and L. Kanal, A general branch and bound formulation for understanding and synthesizing and/or tree search procedures, Artificial Intelligence, pp.179-198, 1983.
DOI : 10.1016/s0004-3702(83)80009-5

O. Kupferman, P. Madhusudan, P. S. Thiagarajan, and M. Y. Vardi, Open systems in reactive environments: Control and synthesis, Proc. Intl. Conf. on Concurrency Theory (CONCUR), pp.92-107, 2000.
DOI : 10.1007/3-540-44618-4_9

O. Kupferman and M. Y. Vardi, Synthesizing distributed systems, In IEEE Symp. on Logic in Computer Sci, pp.389-398, 2001.

A. A. Kurzhanskiy and P. Varaiya, Ellipsoidal techniques for reachability analysis of discrete-time linear systems, IEEE Trans. Automat. Contr, vol.52, issue.1, pp.26-38, 2007.
DOI : 10.1109/tac.2006.887900

U. Kuter and D. Nau, Using domain-configurable search control for probabilistic planning, Proc. AAAI, pp.1169-1174, 2005.

U. Kuter, D. S. Nau, M. Pistore, and P. Traverso, A hierarchical task-network planner based on symbolic model checking, Proc. ICAPS, pp.300-309, 2005.

U. Kuter, D. S. Nau, M. Pistore, and P. Traverso, Task decomposition on abstract states, for planning under nondeterminism, Artificial Intelligence, vol.173, pp.669-695, 2009.
DOI : 10.1016/j.artint.2008.11.012
URL : https://doi.org/10.1016/j.artint.2008.11.012

U. Kuter, D. S. Nau, E. Reisner, and R. Goldman, Using classical planners to solve nondeterministic planning problems, Proc. ICAPS, pp.190-197, 2008.

U. Kuter, E. Sirin, D. S. Nau, B. Parsia, and J. Hendler, Information gathering during planning for web service composition, Proc. Intl. Semantic Web Conf. (ISWC), vol.3298, pp.335-349, 2004.
DOI : 10.21236/ada448050

J. Kvarnström and P. Doherty, TALplanner: A temporal logic based forward chaining planner, Annals of Mathematics and Artificial Intelligence, vol.30, pp.119-169, 2001.

J. Kvarnström, P. Doherty, and P. Haslum, Extending TALplanner with concurrency and resources, Proc. European Conf. on Planning (ECP), 2000.

B. Kveton, M. Hauskrecht, G. , and C. , Solving factored MDPs with hybrid state and action variables, J. Artificial Intelligence Research, vol.27, pp.153-201, 2006.
DOI : 10.1613/jair.2085
URL : https://jair.org/index.php/jair/article/download/10469/25093

P. Laborie, Algorithms for propagating resource constraints in ai planning and scheduling: Existing approaches and new results, Artificial Intelligence, vol.143, issue.2, pp.151-188, 2003.

P. Laborie and M. Ghallab, Planning with sharable resource constraints, Proc. IJCAI, pp.1643-1649, 1995.

J. Laird, P. Rosenbloom, and A. Newell, Universal Subgoaling and Chunking: The Automatic Generation and Learning of Goal Hierarchies, 2012.

C. Laporte and T. Arbel, Efficient discriminant viewpoint selection for active Bayesian recognition, Intl. J. Robotics Research, vol.68, issue.3, pp.267-287, 2006.
DOI : 10.1007/s11263-005-4436-9

E. L. Lawler and D. E. Wood, Branch-and-bound methods: A survey, Operations Research, vol.14, issue.4, pp.699-719, 1966.

L. Guillou, X. Cordier, M. Robin, S. Rozé, and L. , Chronicles for on-line diagnosis of distributed systems, Proc. ECAI, vol.8, pp.194-198, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00461386

S. Lemai-chenevier and F. Ingrand, Interleaving temporal planning and execution in robotics domains, Proc. AAAI, 2004.

S. Lemaignan, R. R. Espinoza, L. Mösenlechner, R. Alami, and M. Beetz, ORO, a knowledge management platform for cognitive architectures in robotics, IEEE/RSJ Intl. Conf. on Intelligent Robots and Syst. (IROS), 2010.

Y. Lesperance, H. J. Lin, L. F. Marcus, D. Reiter, R. Scherl et al., A logical approach to high-level robot programming-a progress report, AAAI Fall Symp. on Control of the Physical World by Intelligent Agents. AAAI, 1994.

H. Levesque, R. Reiter, Y. Lespérance, F. Lin, and R. Scherl, GOLOG: A logic programming language for dynamic domains, J. Logic Programming, vol.31, pp.59-84, 1997.

H. J. Levesque, R. Reiter, Y. Lesperance, F. Lin, and R. Scherl, GOLOG: a logic programming language for dynamic domains, J. Logic Progr, vol.31, pp.59-83, 1997.

S. J. Levine and B. C. Williams, Concurrent plan recognition and execution for human-robot teams, Proc. ICAPS, 2014.

H. X. Li and B. C. Williams, Generative planning for hybrid systems based on flow tubes, Proc. ICAPS, pp.206-213, 2008.

S. Liaskos, S. A. Mcilraith, S. Sohrabi, M. , and J. , Integrating preferences into goal models for requirements engineering, In Intl. Requirements Engg. Conf, pp.135-144, 2010.

V. Liatsos and B. Richard, Scalability in planning, Proc. European Conf. on Planning (ECP), volume 1809 of LNAI, pp.49-61, 1999.

V. Lifschitz, On the semantics of STRIPS, Reasoning about Actions and Plans: Proc. 1986 Wksp, pp.523-530, 1987.

G. Ligozat, On generalized interval calculi, Proc. AAAI, pp.234-240, 1991.

M. Likhachev, G. J. Gordon, and S. Thrun, Planning for Markov decision processes with sparse stochasticity, Adv. in Neural Information Processing Syst. (Proc. NIPS), vol.17, 2004.

S. Lin, Computer solutions of the traveling salesman problem, Bell System Technical Journal, vol.44, issue.10, pp.2245-2269, 1965.

I. Little, D. Aberdeen, and S. Thiébaux, Prottle: A probabilistic temporal planner, Proc. AAAI, pp.1181-1186, 2005.

I. Little and S. Thiébaux, Probabilistic planning vs. replanning, ICAPS Wksp. on the Intl. Planning Competition, 2007.

Y. Liu and S. Koenig, Functional value iteration for decision-theoretic planning with general utility functions, Proc. AAAI, 2006.

J. Löhr, P. Eyerich, T. Keller, and B. Nebel, A planning based framework for controlling hybrid systems, Proc. ICAPS, 2012.

J. Löhr, P. Eyerich, S. Winkler, and B. Nebel, Domain predictive control under uncertain numerical state information, Proc. ICAPS, 2013.

D. Long and M. Fox, Efficient implementation of the plan graph in STAN, J. Artificial Intelligence Research, vol.10, issue.1-2, pp.87-115, 1999.

D. Long and M. Fox, The 3rd international planning competition: Results and analysis, J. Artificial Intelligence Research, vol.20, pp.1-59, 2003.

D. Long and M. Fox, Exploiting a graphplan framework in temporal planning, Proc. ICAPS, pp.52-61, 2003.

A. Lotem and D. S. Nau, New advances in GraphHTN: Identifying independent subproblems in large HTN domains, Proc. AIPS, pp.206-215, 2000.

A. Lotem, D. S. Nau, and J. Hendler, Using planning graphs for solving HTN problems, Proc. AAAI, pp.534-540, 1999.

S. Magnenat, J. C. Chappelier, and F. Mondada, Integration of online learning into HTN planning for robotic tasks, AAAI Spring Symposium, 2012.

S. Maliah, R. Brafman, E. Karpas, S. , and G. , Partially observable online contingent planning using landmark heuristics, Proc. ICAPS, 2014.

J. Malik and T. Binford, Reasoning in time and space, Proc. IJCAI, pp.343-345, 1983.

M. Mansouri and F. Pecora, Robot waiters: A case for hybrid reasoning with different types of knowledge, J. Experimental & Theoretical Artificial Intelligence, 2016.

B. Marthi, S. Russell, and J. Wolfe, Angelic semantics for high-level actions, Proc. ICAPS, 2007.

B. Marthi, S. Russell, and J. Wolfe, Angelic hierarchical planning: Optimal and online algorithms, Proc. ICAPS, pp.222-231, 2008.

B. M. Marthi, S. J. Russell, D. Latham, G. , and C. , Concurrent hierarchical reinforcement learning, Proc. AAAI, p.1652, 2005.

R. Mattmüller, M. Ortlieb, M. Helmert, and P. Bercher, Pattern database heuristics for fully observable nondeterministic planning, Proc. ICAPS, pp.105-112, 2010.

B. Mausam, P. Weld, and D. , A hybridized planner for stochastic domains, Proc. IJCAI, pp.1972-1978, 2007.

K. Mausam and A. , Planning with Markov Decision Processes: An AI Perspective, 2012.

W. Mausam and D. , Concurrent probabilistic temporal planning, Proc. ICAPS, 2005.

W. Mausam and D. , Probabilistic temporal planning with uncertain durations, Proc. AAAI, pp.880-887, 2006.

W. Mausam and D. , Planning with durative actions in stochastic domains, J. Artificial Intelligence Research, vol.31, issue.1, pp.33-82, 2008.

D. Mcallester and D. Rosenblitt, Systematic nonlinear planning, Proc. AAAI, pp.634-639, 1991.

J. Mccarthy, Formalizing Common Sense: Papers by John McCarthy, 1990.

J. Mccarthy and P. J. Hayes, Some philosophical problems from the standpoint of artificial intelligence, Machine Intelligence 4, pp.463-502, 1969.

D. Mcdermott, A temporal logic for reasoning about processes and plans, Cognitive Science, vol.6, pp.101-155, 1982.

D. Mcdermott, A reactive plan language, 1991.

D. M. Mcdermott, The 1998 AI planning systems competition, vol.21, p.35, 2000.

S. A. Mcilraith and T. C. Son, Adapting GOLOG for composition of semantic web services, Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp.482-496, 2002.

H. B. Mcmahan and G. J. Gordon, Fast exact planning in Markov decision processes, Proc. ICAPS, pp.151-160, 2005.

I. Meiri, Faster Constraint satisfaction algorithms for temporal reasoning, 1990.

N. Meuleau, E. Benazera, R. I. Brafman, and E. A. Hansen, A heuristic search approach to planning with continuous resources in stochastic domains, J. Artificial Intelligence Research, vol.34, issue.1, p.27, 2009.

N. Meuleau and R. I. Brafman, Hierarchical heuristic forward search in stochastic domains, Proc. IJCAI, pp.2542-2549, 2007.

I. Miguel, P. Jarvis, and Q. Shen, Flexible graphplan, Proc. ECAI, pp.506-510, 2000.

S. Minton, J. Bresina, and M. Drummond, Commitment strategies in planning: A comparative analysis, Proc. IJCAI, pp.259-265, 1991.

S. Minton, M. Drummond, J. Bresina, and A. Philips, Total order vs. partial order planning: Factors influencing performance, Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp.83-92, 1992.

L. G. Mitten, Branch and bound methods: General formulations and properties, Operations Research, vol.18, pp.23-34, 1970.

T. B. Moeslund, A. Hilton, and V. Krüger, A survey of advances in vision-based human motion capture and analysis, Computer Vision and Image Understanding, vol.104, issue.2-3, pp.90-126, 2006.

M. D. Moffitt, On the modelling and optimization of preferences in constraint-based temporal reasoning, Artificial Intelligence, vol.175, issue.7, pp.1390-1409, 2011.

M. D. Moffitt and M. E. Pollack, Partial constraint satisfaction of disjunctive temporal problems, Proc. Intl. Florida AI Research Soc. Conf. (FLAIRS), pp.715-720, 2005.

M. Molineaux, M. Klenk, A. , and D. , Goal-driven autonomy in a Navy strategy simulation, Proc. AAAI, pp.1548-1554, 2010.

B. Morisset, M. Ghallab, M. Beetz, J. Hertzberg, M. Ghallab et al., Learning how to combine sensorymotor modalities for a robust behavior, Advances in Plan-based Control of Robotics Agents, volume 2466 of LNAI, pp.157-178, 2002.

B. Morisset and M. Ghallab, Synthesis of supervision policies for robust sensory-motor behaviors, Intl. Conf. on Intell. and Autonomous Syst. (IAS), pp.236-243, 2002.

P. Morris, Dynamic controllability and dispatchability relationships, Integration of AI and OR, pp.464-479, 2014.

P. Morris, N. Muscettola, and T. Vidal, Dynamic control of plans with temporal uncertainty, Proc. IJCAI, pp.494-502, 2001.

P. H. Morris and N. Muscettola, Temporal dynamic controllability revisited, Proc. AAAI, pp.1193-1198, 2005.

C. Muise, S. A. Mcilraith, B. , and V. , Non-deterministic planning with conditional effects, Proc. ICAPS, 2014.

C. J. Muise, S. A. Mcilraith, and J. C. Beck, Improved nondeterministic planning by exploiting state relevance, Proc. ICAPS, 2012.

R. Munos and A. W. Moore, Variable resolution discretization in optimal control, Machine Learning, vol.49, pp.291-323, 2002.

H. Muñoz-avila, D. W. Aha, D. S. Nau, R. Weber, L. Breslow et al., SiN: Integrating case-based reasoning with task decomposition, Proc. IJCAI, 2001.

N. Muscettola, G. Dorais, C. Fry, R. Levinson, P. et al., IDEA: Planning at the core of autonomous reactive agents, Intl. Wksp. on Planning and Scheduling for Space (IWPSS), 2002.

N. Muscettola, P. H. Morris, T. , and I. , Reformulating temporal plans for efficient execution, Principles of Knowledge Representation and Reasoning, pp.444-452, 1998.

N. Muscettola, P. P. Nayak, B. Pell, W. , and B. C. , Remote Agent: To boldly go where no AI system has gone before, Artificial Intelligence, vol.103, pp.5-47, 1998.

K. L. Myers, CPEF: A continuous planning and execution framework, AI Magazine, vol.20, issue.4, pp.63-69, 1999.

A. Nareyek, E. C. Freuder, R. Fourer, E. Giunchiglia, R. P. Goldman et al., Constraints and AI planning, IEEE Intelligent Systems, vol.20, issue.2, pp.62-72, 2005.

D. S. Nau, T. Au, O. Ilghami, U. Kuter, H. Muñoz-avila et al., Applications of SHOP and SHOP2, IEEE Intelligent Systems, vol.20, issue.2, pp.34-41, 2005.

D. S. Nau, T. Au, O. Ilghami, U. Kuter, J. W. Murdock et al., SHOP2: An HTN planning system, J. Artificial Intelligence Research, vol.20, pp.379-404, 2003.

D. S. Nau, Y. Cao, A. Lotem, and H. Muñoz-avila, SHOP: Simple hierarchical ordered planner, Proc. IJCAI, pp.968-973, 1999.

D. S. Nau, V. Kumar, and L. N. Kanal, General branch and bound, and its relation to A* and AO*, Artificial Intelligence, vol.23, issue.1, pp.29-58, 1984.

D. S. Nau, H. Muñoz-avila, Y. Cao, A. Lotem, M. et al., Total-order planning with partially ordered subtasks, Proc. IJCAI, 2001.

B. Nebel and H. Burckert, Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra, J. ACM, vol.42, issue.1, pp.43-66, 1995.

A. Newell and G. Ernst, The search for generality, Proc. IFIP Congress, vol.65, pp.17-24, 1965.

A. Newell and H. A. Simon, GPS, a program that simulates human thought, Computers and Thought, 1963.

M. A. Newton, J. Levine, M. Fox, L. , and D. , Learning macroactions for arbitrary planners and domains, Proc. ICAPS, 2007.

A. Ng and M. Jordan, PEGASUS: a policy search method for large MDPs and POMDPs, Proc. Conf. on Uncertainty in AI (UAI), pp.406-415, 2000.

N. Nguyen and S. Kambhampati, Reviving partial order planning, Proc. IJCAI, 2001.

M. N. Nicolescu and M. J. Mataric, Natural methods for robot task learning: instructive demonstrations, generalization and practice, Proc. AAMAS, pp.241-248, 2003.
DOI : 10.1145/860575.860614

R. Nieuwenhuis, A. Oliveras, and C. Tinelli, Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL (T), J. ACM, vol.53, issue.6, pp.937-977, 2006.
DOI : 10.1145/1217856.1217859

E. Nikolova and D. R. Karger, Route planning under uncertainty: The Canadian traveller problem, Proc. AAAI, pp.969-974, 2008.

M. Nilsson, J. Kvarnström, and P. Doherty, EfficientIDC: A faster incremental dynamic controllability algorithm, Proc. ICAPS, 2014.

M. Nilsson, J. Kvarnström, and P. Doherty, Incremental dynamic controllability in cubic worst-case time, Intl. Symp. on Temporal Representation and Reasoning, 2014.
DOI : 10.1109/time.2014.13

N. Nilsson, Principles of Artificial Intelligence, 1980.

M. Oaksford and N. Chater, Bayesian rationality the probabilistic approach to human reasoning, 2007.
DOI : 10.1017/s0140525x09000284
URL : http://discovery.ucl.ac.uk/135353/1/download.16pdf.pdf

T. Oates and P. R. Cohen, Learning planning operators with conditional and probabilistic effects, Proc. AAAI Spring Symposium on Planning with Incomplete Information for Robot Problems, pp.86-94, 1996.

S. C. Ong, S. W. Png, D. Hsu, and W. S. Lee, Planning under uncertainty for robotic tasks with mixed observability, Intl. J. Robotics Research, vol.29, issue.8, pp.1053-1068, 2010.
DOI : 10.1177/0278364910369861
URL : http://www.comp.nus.edu.sg/%7Eleews/publications/tro09momdp.pdf

C. Papadimitriou, Computational Complexity, 1994.

R. Parr and S. J. Russell, Reinforcement learning with hierarchies of machines, Adv. in Neural Information Processing Syst. (Proc. NIPS), pp.1043-1049, 1998.

H. Pasula, L. S. Zettlemoyer, and L. P. Kaelbling, Learning probabilistic relational planning rules, Proc. ICAPS, pp.73-82, 2004.

J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, 1984.

F. Pecora, M. Cirillo, F. Dell'osa, J. Ullberg, and A. Saffiotti, A constraint-based approach for proactive, context-aware human support, J. Ambient Intell. and Smart Environments, vol.4, issue.4, pp.347-367, 2012.

E. Pednault, Synthesizing plans that contain actions with contextdependent effects, Computational Intelligence, vol.4, pp.356-372, 1988.
DOI : 10.1111/j.1467-8640.1988.tb00285.x

E. P. Pednault, ADL: Exploring the middle ground between STRIPS and the situation calculus, Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR), pp.324-332, 1989.

J. Penberthy and D. S. Weld, Temporal planning with continuous change, Proc. AAAI, pp.1010-1015, 1994.

J. S. Penberthy and D. Weld, UCPOP: A sound, complete, partial order planner for ADL, Proc. Intl. Conf. on Principles of Knowledge Representation and Reasoning, 1992.

G. D. Penna, B. Intrigila, D. Magazzeni, and F. Mercorio, Upmurphi: a tool for universal planning on PDDL+ problems, Proc. ICAPS, pp.19-23, 2009.

M. Peot and D. Smith, Conditional nonlinear planning, Proc. AIPS, pp.189-197, 1992.

J. Peters and A. Y. Ng, Special issue on robot learning, Autonomous Robots, vol.27, pp.1-2, 2009.

R. Petrick and F. Bacchus, Extending the knowledge-based approach to planning with incomplete information and sensing, Proc. ICAPS, pp.2-11, 2004.

O. Pettersson, Execution monitoring in robotics: A survey, Robotics and Autonomous Systems, vol.53, issue.2, pp.73-88, 2005.

J. Piaget, The Psychology of Intelligence, 1951.

J. Piaget, Studies in Reflecting Abstraction, 2001.

J. Pineau, G. J. Gordon, and S. Thrun, Policy-contingent abstraction for robust robot control, Proc. Conf. on Uncertainty in AI (UAI), pp.477-484, 2002.

J. Pineau, M. Montemerlo, M. E. Pollack, N. Roy, and S. Thrun, Towards robotic assistants in nursing homes: Challenges and results, Robotics and Autonomous Systems, vol.42, issue.3-4, pp.271-281, 2003.

M. Pistore, R. Bettin, and P. Traverso, Symbolic techniques for planning with extended goals in non-deterministic domains, Proc. European Conf. on Planning (ECP), LNAI, 2001.

M. Pistore, L. Spalazzi, and P. Traverso, A minimalist approach to semantic annotations for web processes compositions, Euro. Semantic Web Conf. (ESWC), pp.620-634, 2006.

M. Pistore and P. Traverso, Planning as model checking for extended goals in non-deterministic domains, Proc. IJCAI, pp.479-484, 2001.

M. Pistore and P. Traverso, Assumption-based composition and monitoring of web services, Test and Analysis of Web Services, pp.307-335, 2007.

M. Pistore, P. Traverso, and P. Bertoli, Automated composition of web services by planning in asynchronous domains, Proc. ICAPS, pp.2-11, 2005.

L. R. Planken, Incrementally solving the STP by enforcing partial path consistency, Proc. Wksp. of the UK Planning and Scheduling Special Interest Group (PlanSIG), pp.87-94, 2008.

A. Pnueli and R. Rosner, On the synthesis of a reactive module, Proc. ACM Conf. on Principles of Programming Languages, pp.179-190, 1989.

A. Pnueli and R. Rosner, On the synthesis of an asynchronous reactive module, Proc. Intl. Colloq. Automata, Langs. and Program. (ICALP), pp.652-671, 1989.

A. Pnueli and R. Rosner, Distributed reactive systems are hard to synthesize, 31st Annual Symposium on Foundations of Computer Science, pp.746-757, 1990.

I. Pohl, Heuristic search viewed as path finding in a graph, Artificial Intelligence, vol.1, issue.3, pp.193-204, 1970.

M. E. Pollack and J. F. Horty, There's more to life than making plans: Plan management in dynamic, multiagent environments, vol.20, pp.1-14, 1999.

J. Porteous, L. Sebastia, and J. Hoffmann, On the extraction, ordering, and usage of landmarks in planning, Proc. European Conf. on Planning (ECP), 2001.

J. Powell, M. Molineaux, A. , and D. , Active and interactive discovery of goal selection knowledge, FLAIRS, 2011.

S. Prentice and N. Roy, The belief roadmap: Efficient planning in belief space by factoring the covariance, vol.IJRR, pp.1448-1465, 2009.

L. Pryor and G. Collins, Planning for contingency: A decision based approach, J. Artificial Intelligence Research, vol.4, pp.81-120, 1996.

M. L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1994.

F. Py, K. Rajan, and C. Mcgann, A systematic agent framework for situated autonomous systems, Proc. AAMAS, pp.583-590, 2010.

D. V. Pynadath and M. P. Wellman, Probabilistic state-dependent grammars for plan recognition, Proc. Conf. on Uncertainty in AI (UAI), pp.507-514, 2000.

R. Quiniou, M. Cordier, G. Carrault, W. , and F. , Application of ILP to cardiac arrhythmia characterization for chronicle recognition, Inductive Logic Programming, pp.220-227, 2001.

G. Rabideau, R. Knight, S. Chien, A. Fukunaga, G. et al., Iterative repair planning for spacecraft operations in the ASPEN system, Intl. Symp. on Artificial Intell., Robotics and Automation in Space (i-SAIRAS), 1999.

L. Rabiner and B. H. Juang, An introduction to hidden Markov models, IEEE ASSP Mag, vol.3, issue.1, pp.4-16, 1986.

K. Rajan and F. Py, T-REX: Partitioned inference for AUV mission control, Further Advances in Unmanned Marine Vehicles, pp.171-199, 2012.

K. Rajan, F. Py, and J. Barreiro, Towards deliberative control in marine robotics, Marine Robot Autonomy, pp.91-175, 2012.

M. Ramirez and H. Geffner, Probabilistic plan recognition using off-the-shelf classical planners, Proc. AAAI, pp.1121-1126, 2010.

M. Ramírez, N. Yadav, and S. Sardiña, Behavior composition as fully observable non-deterministic planning, Proc. ICAPS, 2013.

M. Ramrez and S. Sardina, Directed fixed-point regression-based planning for non-deterministic domains, Proc. ICAPS, 2014.

E. Reingold, J. Nievergelt, and N. Deo, Combinatorial Optimization, 1977.

S. Richter, M. Helmert, and M. Westphal, Landmarks revisited, Proc. AAAI, vol.8, pp.975-982, 2008.

S. Richter and M. Westphal, The LAMA planner: Guiding cost-based anytime planning with landmarks, J. Artificial Intelligence Research, vol.39, issue.1, pp.127-177, 2010.

J. Rintanen, Constructing conditional plans by a theorem-prover, J. Artificial Intelligence Research, vol.10, pp.323-352, 1999.

J. Rintanen, An iterative algorithm for synthesizing invariants, Proc. AAAI, pp.1-6, 2000.

J. Rintanen, Backward plan construction for planning as search in belief space, Proc. AIPS, 2002.

J. Rintanen, Conditional planning in the discrete belief space, Proc. IJCAI, 2005.

M. D. Rodriguez-moreno, A. Oddi, D. Borrajo, C. , and A. , Ipss: A hybrid approach to planning and scheduling integration, IEEE Trans. Knowledge and Data Engg. (TDKE), vol.18, issue.12, pp.1681-1695, 2006.

S. Ross, J. Pineau, S. Paquet, and B. Chaib-draa, Online planning algorithms for POMDPs, J. Artificial Intelligence Research, vol.32, pp.663-704, 2008.

S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, 2009.

P. E. Rybski, K. Yoon, J. Stolarz, and M. M. Veloso, Interactive robot task training through dialog and demonstration, Conference on HumanRobot Interaction, pp.49-56, 2007.

E. Sacerdoti, Planning in a hierarchy of abstraction spaces, Artificial Intelligence, vol.5, pp.115-135, 1974.

E. Sacerdoti, The nonlinear nature of plans, Proc. IJCAI, pp.162-170, 1975.

M. Samadi, T. Kollar, and M. Veloso, Using the Web to interactively learn to find objects, Proc. AAAI, pp.2074-2080, 2012.

H. Samet, Foundations of multidimensional and metric data structures, 2006.

E. Sandewall, Features and Fluents: The Representation of Knowledge about Dynamical Systems, 1994.

E. Sandewall and R. Rönnquist, A representation of action structures, Proc. AAAI, pp.89-97, 1986.

S. Sanner, Relational dynamic influence diagram language (RDDL): Language description, 2010.

P. H. Santana and B. C. Williams, Chance-constrained consistency for probabilistic temporal plan networks, Proc. ICAPS, 2014.

B. Scherrer and B. Lesner, On the use of non-stationary policies for stationary infinite-horizon Markov decision processes, Adv. in Neural Information Processing Syst. (Proc. NIPS), pp.1826-1834, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00758809

D. G. Schultz and J. L. Melsa, State functions and linear control systems, 1967.

M. Shah, L. Chrpa, F. Jimoh, D. Kitchin, T. Mccluskey et al., Knowledge engineering tools in planning: State-of-the-art and future challenges, ICAPS Knowledge Engg. for Planning and Scheduling (KEPS), pp.53-60, 2013.

G. Shani, J. Pineau, and R. Kaplow, A survey of point-based POMDP solvers, J. Autonomous Agents and Multi-Agent Syst, pp.1-51, 2012.

D. Shaparau, M. Pistore, and P. Traverso, Contingent planning with goal preferences, Proc. AAAI, pp.927-935, 2006.

D. Shaparau, M. Pistore, and P. Traverso, Fusing procedural and declarative planning goals for nondeterministic domains, Proc. AAAI, pp.983-990, 2008.

V. Shivashankar, R. Alford, U. Kuter, and D. Nau, The GoDeL planning system: A more perfect union of domain-independent and hierarchical planning, Proc. IJCAI, pp.2380-2386, 2013.

Y. Shoahm and D. Mcdermott, Problems in formal temporal reasoning, Artificial Intelligence, vol.36, pp.49-61, 1988.

J. R. Shoenfield, Mathematical Logic, 1967.

Y. Shoham, Temporal logic in AI: semantical and ontological considerations, Artificial Intelligence, vol.33, pp.89-104, 1987.

O. Sigaud and J. Peters, From Motor Learning to Interaction Learning in Robots, Studies in Computational Intelligence, vol.264, 2010.

D. Silver and J. Veness, Monte-Carlo planning in large POMDPs, Adv. in Neural Information Processing Syst. (Proc. NIPS), 2010.

R. Simmons, Concurrent planning and execution for autonomous robots, IEEE Control Systems, vol.12, issue.1, pp.46-50, 1992.

R. Simmons, Structured control for autonomous robots, IEEE Trans. Robotics and Automation, vol.10, issue.1, pp.34-43, 1994.

R. Simmons and D. Apfelbaum, A task description language for robot control, IEEE/RSJ Intl. Conf. on Intelligent Robots and Syst. (IROS), pp.1931-1937, 1998.

C. Simpkins, S. Bhat, .. Isbell, C. Mateas, and M. , Towards adaptive programming: integrating reinforcement learning into a programming language, Proc. ACM SIGPLAN Conf. on Object-Oriented Progr. Syst., Lang., and Applications (OOPSLA), pp.603-614, 2008.

R. M. Simpson, D. E. Kitchin, and T. Mccluskey, Planning domain definition using GIPO, The Knowledge Engineering Review, vol.22, issue.2, pp.117-134, 2007.

E. Sirin, B. Parsia, D. Wu, J. Hendler, and D. S. Nau, HTN planning for Web service composition using SHOP2, J. Web Semant. (JWS), vol.1, issue.4, pp.377-396, 2004.

D. E. Smith, J. Frank, and W. Cushing, The ANML language. ICAPS Wksp. on Knowledge Engg. for Planning and Scheduling (KEPS), 2008.

D. E. Smith, J. Frank, J. , and A. K. , Bridging the gap between planning and scheduling, The Knowledge Engineering Review, vol.15, issue.1, pp.47-83, 2000.

D. E. Smith and D. Weld, Temporal planning with mutual exclusion reasoning, Proc. IJCAI, 1999.

D. E. Smith and D. S. Weld, Conformant Graphplan, Proc. AAAI, pp.889-896, 1998.

D. E. Smith and D. S. Weld, Temporal planning with mutual exclusion reasoning, Proc. IJCAI, pp.326-337, 1999.

S. J. Smith, K. Hebbar, D. S. Nau, and I. Minis, Integrating electrical and mechanical design and process planning, Knowledge Intensive CAD, pp.269-288, 1997.

S. J. Smith, D. S. Nau, and T. Throop, Computer bridge: A big win for AI planning, vol.19, pp.93-105, 1998.

T. Smith and R. Simmons, Heuristic search value iteration for POMDPs, Proc. Conf. on Uncertainty in AI (UAI), 2004.

S. Sohrabi, J. A. Baier, and S. A. Mcilraith, Htn planning with preferences, Proc. IJCAI, pp.1790-1797, 2009.

S. Sohrabi and S. A. Mcilraith, Preference-based web service composition: A middle ground between execution and search, Proc. Intl. Semantic Web Conf. (ISWC), pp.713-729, 2010.

M. Sridharan, J. L. Wyatt, and R. Dearden, HiPPo: Hierarchical POMDPs for planning information processing and sensing actions on a robot, Proc. ICAPS, pp.346-354, 2008.

B. Srivastava, Realplan: Decoupling causal and resource reasoning in planning, Proc. AAAI, pp.812-818, 2000.

J. Stedl and B. Williams, A fast incremental dynamic controllability algorithm, Proc. ICAPS Wksp. on Plan Execution, 2005.

F. Stulp and M. Beetz, Refining the execution of abstract actions with learned action models, J. Artificial Intelligence Research, vol.32, issue.1, pp.487-523, 2008.

H. A. Taha, Integer Programming: Theory, Applications, and Computations, 1975.

R. E. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Computing, vol.1, issue.2, pp.146-160, 1972.

A. Tate, Generating project networks, Proc. IJCAI, pp.888-893, 1977.

. Authors'-manuscript,

A. Tate, B. Drabble, K. , and R. , O-Plan2: An Architecture for Command, Planning and Control, 1994.

E. Téglás, E. Vul, V. Girotto, M. Gonzalez, J. B. Tenenbaum et al., Pure reasoning in 12-month-old infants as probabilistic inference, Science, vol.332, issue.6033, pp.1054-1059, 2011.

F. Teichteil-königsbuch, Fast incremental policy compilation from plans in hybrid probabilistic domains, Proc. ICAPS, 2012.

F. Teichteil-königsbuch, Stochastic safest and shortest path problems, Proc. AAAI, pp.1825-1831, 2012.

F. Teichteil-königsbuch, G. Infantes, and U. Kuter, RFF: A robust, FF-based MDP planning algorithm for generating policies with low probability of failure, Proc. ICAPS, 2008.

F. Teichteil-königsbuch, U. Kuter, and G. Infantes, Incremental plan aggregation for generating policies in MDPs, Proc. AAMAS, pp.1231-1238, 2010.

F. Teichteil-königsbuch, V. Vidal, and G. Infantes, Extending classical planning heuristics to probabilistic planning with dead-ends, Proc. AAAI, pp.1-6, 2011.

M. Tenorth and M. Beetz, KnowRob: A knowledge processing infrastructure for cognition-enabled robots, Intl. J. Robotics Research, vol.32, issue.5, pp.566-590, 2013.

P. Traverso, M. Veloso, and F. Giunchiglia, AIPS Wksp. on Model-Theoretic Approaches to Planning, 2000.

M. Van-den-briel, T. Vossen, and S. Kambampati, Reviving integer programming approaches for AI planning: A branch-and-cut framework, Proc. ICAPS, pp.310-319, 2005.

M. Van-den-briel, T. Vossen, and S. Kambhampati, Loosely coupled formulations for automated planning: An integer programming perspective, J. Artificial Intelligence Research, vol.31, pp.217-257, 2008.

T. S. Vaquero, V. Romero, F. Tonidandel, and J. R. Silva, itSIMPLE 2.0: An integrated tool for designing planning domains, Proc. ICAPS, pp.336-343, 2007.

T. S. Vaquero, J. R. Silva, and J. C. Beck, A brief review of tools and methods for knowledge engineering for planning & scheduling, ICAPS Knowledge Engg. for Planning and Scheduling (KEPS), pp.7-15, 2011.

M. Y. Vardi, An automata-theoretic approach to fair realizability and synthesis, Proc. Intl. Conf. on Computer Aided Verification, pp.267-278, 1995.
DOI : 10.1007/3-540-60045-0_56

M. Y. Vardi, From verification to synthesis, Proc. Intl. Conf. on Verified Software: Theories, Tools, Experiments, 2008.
DOI : 10.1007/978-3-540-87873-5_2

S. Vattam, M. Klenk, M. Molineaux, and D. W. Aha, Breadth of approaches to goal reasoning: A research survey, ACS Wksp. on Goal Reasoning, 2013.

J. Velez, G. Hemann, A. Huang, I. Posner, R. et al., Planning to perceive: Exploiting mobility for robust object detection, Proc. ICAPS, 2011.

M. Veloso and P. Stone, FLECS: planning with a flexible commitment strategy, J. Artificial Intelligence Research, vol.3, pp.25-52, 1995.
DOI : 10.1613/jair.131
URL : https://jair.org/index.php/jair/article/download/10137/24013

M. M. Veloso and P. Rizzo, Mapping planning actions and partiallyordered plans into execution knowledge, Wksp. on Integrating Planning, Scheduling and Execution in Dynamic and Uncertain Environments, pp.94-97, 1998.

S. Vere, Planning in time: Windows and duration for activities and goals, IEEE Trans. Pattern Analysis and Machine Intell, vol.5, issue.3, pp.246-264, 1983.
DOI : 10.1109/tpami.1983.4767389

G. Verfaillie, C. Pralet, M. , and L. , How to model planning and scheduling problems using timelines, The Knowledge Engineering Review, vol.25, pp.319-336, 2010.
DOI : 10.1017/s0269888910000172

V. Verma, T. Estlin, A. K. Jónsson, C. Pasareanu, R. Simmons et al., Plan execution interchange language (PLEXIL) for executable plans and command sequences, In Intl. Symp. on Artificial Intell, 2005.

S. Vernhes, G. Infantes, and V. Vidal, Problem splitting using heuristic search in landmark orderings, Proc. IJCAI, pp.2401-2407, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01002115

T. Verweij, A hierarchically-layered multiplayer bot system for a first-person shooter, 2007.

T. Vidal and H. Fargier, Handling contingency in temporal constraint networks: from consistency to controllabilities, J. Experimental & Theoretical Artificial Intelligence, 1999.

T. Vidal and M. Ghallab, Dealing with uncertain durations in temporal constraints networks dedicated to planning, ECAI, pp.48-52, 1996.

M. Vilain and H. Kautz, Constraint propagation algorithms for temporal reasoning, Proc. AAAI, pp.377-382, 1986.
DOI : 10.1016/b978-1-4832-1447-4.50034-1

M. Vilain, H. Kautz, and P. Van-beek, Constraint propagation algorithms for temporal reasoning: a revised report, Readings in Qualitative Reasoning about Physical Systems, 1989.
DOI : 10.1016/b978-1-4832-1447-4.50034-1

J. Vodrázka and L. Chrpa, Visual design of planning domains, Wksp. on Knowledge Engg. for Planning and Scheduling (KEPS), pp.68-69, 2010.

V. Vu, F. Bremond, and M. Thonnat, Automatic video interpretation: A novel algorithm for temporal scenario recognition, Proc. IJCAI, pp.1295-1300, 2003.

M. Waibel, M. Beetz, J. Civera, R. D'andrea, J. Elfring et al., RoboEarth. IEEE Robotics and Automation Magazine, vol.18, pp.69-82, 2011.

R. Waldinger, Achieving several goals simultaneously, Machine Intelligence 8, pp.118-139, 1977.

T. J. Walsh and M. L. Littman, Efficient learning of action schemas and Web-service descriptions, Proc. AAAI, 2008.

F. Y. Wang, K. J. Kyriakopoulos, A. Tsolkas, and G. N. Saridis, A Petri-net coordination model for an intelligent mobile robot, IEEE Trans. Syst., Man, and Cybernetics, vol.21, issue.4, pp.777-789, 1991.

D. H. Warren, Generating conditional plans and programs, Proc. Summer Conf. on Artificial Intelligence and Simulation of Behaviour, 1976.

A. A. Weir, J. Chappell, and A. Kacelnik, Shaping of hooks in New Caledonian crows, Science, vol.297, issue.5583, p.981, 2002.

D. Weld, Recent advances in AI planning, AI Magazine, vol.20, issue.2, pp.93-122, 1999.

D. S. Weld, An introduction to least commitment planning, AI Magazine, vol.15, issue.4, pp.27-61, 1994.

D. S. Weld, C. R. Anderson, and D. E. Smith, Extending Graphplan to handle uncertainty and sensing actions, Proc. AAAI, pp.897-904, 1998.

D. S. Weld and O. Etzioni, The first law of robotics (a call to arms), Proc. AAAI, pp.1042-1047, 1994.

D. Wilkins, Using the SIPE-2 planning system: A manual for version 6, vol.1, 2000.

D. Wilkins and M. Desjardins, A call for knowledge-based planning, vol.22, pp.99-115, 2001.

D. E. Wilkins, Practical Planning: Extending the Classical AI Planning Paradigm, 1988.

D. E. Wilkins and K. L. Myers, A common knowledge representation for plan generation and reactive execution, J. Logic and Computation, vol.5, issue.6, pp.731-761, 1995.

B. C. Williams and M. Abramson, Executing reactive, model-based programs through graph-based temporal planning, Proc. IJCAI, 2001.

B. C. Williams and P. P. Nayak, A model-based approach to reactive self-configuring systems, Proc. AAAI, pp.971-978, 1996.

A. Wilson, A. P. Fern, and P. Tadepalli, A bayesian approach for policy learning from trajectory preference queries, Adv. in Neural Information Processing Syst. (Proc. NIPS), pp.1142-1150, 2012.

D. Wingate and K. D. Seppi, Prioritization methods for accelerating MDP solvers, J. Machine Learning Research, vol.6, pp.851-881, 2005.

L. Wittgenstein, Philosophical Investigations, 1999.

T. Wongpiromsarn, U. Topcu, N. Ozay, H. Xu, M. et al., TuLiP: a software toolbox for receding horizon temporal logic planning, 14th Intl. Conf. on Hybrid Syst.: Computation and Control, pp.313-314, 2011.

Y. Wu, T. S. Huang, A. Braffort, R. Gherbi, S. Gibet et al., Vision-based gesture recognition: A review, Gesture-Based Communication in Human-Computer Interaction, pp.103-115, 1999.
DOI : 10.1007/3-540-46616-9_10

F. Xie, M. Müller, and R. Holte, Understanding and improving local exploration for gbfs, Proc. ICAPS, 2015.

Y. Xu, A. Fern, and S. W. Yoon, Discriminative learning of beamsearch heuristics for planning, Proc. IJCAI, 2007.

Q. Yang, Formalizing planning knowledge for hierarchical planning, Computational Intelligence, vol.6, issue.1, pp.12-24, 1990.
DOI : 10.1111/j.1467-8640.1990.tb00126.x

Q. Yang, Intelligent Planning: A Decomposition and Abstraction Based Approach, 1997.

Q. Yang, K. Wu, J. , and Y. , Learning action models from plan examples using weighted MAX-SAT, Artificial Intelligence, vol.171, issue.2, pp.107-143, 2007.
DOI : 10.1016/j.artint.2006.11.005
URL : https://doi.org/10.1016/j.artint.2006.11.005

S. Yoon, A. Fern, G. , and R. , Learning heuristic functions from relaxed plans, Proc. ICAPS, 2006.

S. Yoon, A. P. Fern, G. , and R. , FF-replan: A baseline for probabilistic planning, Proc. ICAPS, pp.352-359, 2007.

S. Yoon, A. P. Fern, R. Givan, and S. Kambhampati, Probabilistic planning via determinization in hindsight, Proc. AAAI, 2008.

H. Younes and M. Littman, PPDDL: The probabilistic planning domain definition language, 2004.

H. Younes and R. Simmons, On the role of ground actions in refinement planning, Proc. AIPS, pp.54-62, 2002.

H. Younes and R. Simmons, VHPOP: Versatile heuristic partial order planner, J. Artificial Intelligence Research, 2003.
DOI : 10.1613/jair.1136
URL : http://www.tempastic.org/papers/jair2003.pdf

H. Younes and R. Simmons, Solving generalized semi-Markov decision processes using continuous phase-type distributions, Proc. AAAI, pp.742-747, 2004.

W. Zhang, State-space search: Algorithms, complexity, extensions, and applications, 1999.

H. H. Zhuo, D. H. Hu, C. Hogg, Q. Yang, and H. Muñoz-avila, , 2009.

, Learning HTN method preconditions and action models from partial observations, Proc. IJCAI, pp.1804-1810

H. H. Zhuo, Q. Yang, D. H. Hu, L. , and L. , Learning complex action models with quantifiers and logical implications, Artificial Intelligence, vol.174, issue.18, pp.1540-1569, 2010.
DOI : 10.1016/j.artint.2010.09.007
URL : https://doi.org/10.1016/j.artint.2010.09.007

T. Zimmerman and S. Kambhampati, Learning-assisted automated planning: Looking back, taking stock, going forward, vol.24, p.73, 2003.

V. A. Ziparo, L. Iocchi, P. U. Lima, D. Nardi, and P. F. Palamara, Petri net plans, J. Autonomous Agents and Multi-Agent Syst, vol.23, issue.3, pp.344-383, 2011.