Finding and Optimizing Solvable Priority Schemes for Decoupled Path Planning Techniques for Teams of Mobile Robots
暂无分享,去创建一个
[1] J. Bengtsson,et al. Modelling and Veri cation of Real-Time Systems Using Timed Automata: Theory and Practice , 1999 .
[2] Marcus Hoffmann. Zur Automatisierung des Designprozesses fluidischer Systeme , 1999 .
[3] Gerhard Fischer,et al. Embedding critics in design environments , 1993, The Knowledge Engineering Review.
[4] Jörg Hoffmann,et al. On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm , 2000, J. Artif. Intell. Res..
[5] Blai Bonet,et al. A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.
[6] Piergiorgio Bertoli,et al. Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking , 2001, IJCAI.
[7] Andreas Hein,et al. Applying feature models in industrial settings , 2000, SPLC.
[8] Klaus Fischer,et al. A DAI approach to modeling the transportation domain , 1993 .
[9] Nils J. Nilsson,et al. Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[10] Fahiem Bacchus,et al. The AIPS '00 Planning Competition , 2001, AI Mag..
[11] Stefan Edelkamp,et al. First Solutions to PDDL+ Planning Problems , 2001 .
[12] Jürgen Dorn,et al. Iterative Improvement Methods for Knowledge-Based Scheduling , 1995, AI Commun..
[13] Günther Schmidt,et al. A decentralized approach for the conflict-free motion of multiple mobile robots , 1996, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems. IROS '96.
[14] Jürgen Sauer,et al. Meta-scheduling using dynamic scheduling knowledge , 1993 .
[15] Alexander Reinefeld,et al. Enhanced Iterative-Deepening Search , 1994, IEEE Trans. Pattern Anal. Mach. Intell..
[16] Alexander Nareyek,et al. Constraint-Based Agents , 2001, Lecture Notes in Computer Science.
[17] Randal E. Bryant,et al. Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.
[18] Mark H. Overmars,et al. Coordinated motion planning for multiple car-like robots using probabilistic roadmaps , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.
[19] Gerald L. Thompson,et al. A mixed-initiative scheduling workbench integrating AI, OR and HCI , 1993, Decis. Support Syst..
[20] Pierre Tournassoud. A strategy for obstacle avoidance and its application to mullti-robot systems , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[21] N. Cutland. Computability: An Introduction to Recursive Function Theory , 1980 .
[22] Ivan Serina,et al. Fast Planning through Greedy Action Graphs , 1999, AAAI/IAAI.
[23] Ulrich Meyer,et al. Theory and Practice of Time-Space Trade-Offs in Memory Limited Search , 2001, KI/ÖGAI.
[24] Frank Reffel,et al. Error Detection with Directed Symbolic Model Checking , 1999, World Congress on Formal Methods.
[25] D. Long,et al. E cient Implementation of the Plan Graph in STAN , 1999 .
[26] Klaus Fischer,et al. TRANSPORTATION SCHEDULING WITH HOLONIC MAS : THE TELETRUCK APPROACH , 1998 .
[27] Stefan Edelkamp. Mixed Propositional and Numeric Planning in the Model Checking Integrated Planning System , 2002, AIPS Workshop on Planning for Temporal Domains.
[28] Jihong Lee,et al. A minimum-time trajectory planning method for two robots , 1992, IEEE Trans. Robotics Autom..
[29] Fausto Giunchiglia,et al. Planning via Model Checking: A Decision Procedure for AR , 1997, ECP.
[30] Peter Piela. Ascend: an object-oriented computer environment for modeling and analysis , 1989 .
[31] Klaus Fischer,et al. Cooperative Transportation Scheduling: An Application Domain for DAI , 1996, Appl. Artif. Intell..
[32] Marco Pistore,et al. Planning as Model Checking for Extended Goals in Non-deterministic Domains , 2001, IJCAI.
[33] Bernhard Nebel,et al. Extending Planning Graphs to an ADL Subset , 1997, ECP.
[34] Yuri V. Matiyasevich,et al. Decision problems for semi-Thue systems with a few rules , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[35] Elizabeth Szelke,et al. Artificial Intelligence in Reactive Scheduling , 1995, IFIP Advances in Information and Communication Technology.
[36] Rachid Alami,et al. One action is enough to plan , 2001, IJCAI.
[37] Sture Hägglund. Introducing expert critiquing systems , 1993, Knowl. Eng. Rev..
[38] Darwin Klingman,et al. Shortest path forest with topological ordering: An algorithm description in SDL , 1980 .
[39] Blai Bonet,et al. Planning as heuristic search , 2001, Artif. Intell..
[40] Jacky Estublier. Software configuration management: a roadmap , 2000, ICSE '00.
[41] Z E. Jess Friedman-hill,et al. The Java Expert System Shell , 2000 .
[42] Thierry Siméon,et al. Multiple Path Coordination for Mobile Robots: A Geometric Algorithm , 1999, IJCAI.
[43] M. Calisti,et al. FOUNDATION FOR INTELLIGENT PHYSICAL AGENTS , 2000 .
[44] V. S. Subrahmanian,et al. Complexity, Decidability and Undecidability Results for Domain-Independent Planning , 1995, Artif. Intell..
[45] Tom Bylander,et al. The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..
[46] Piergiorgio Bertoli,et al. Improving Heuristics for Planning as Search in Belief Space , 2002, AIPS.
[47] Maria Fox,et al. The Detection and Exploitation of Symmetry in Planning Problems , 1999, IJCAI.
[48] Jeremy Frank,et al. When Gravity Fails: Local Search Topology , 1997, J. Artif. Intell. Res..
[49] Manuela M. Veloso,et al. OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains , 2000, J. Artif. Intell. Res..
[50] Andreas Günter,et al. Flexible control in expert systems for construction tasks , 2004, Applied Intelligence.
[51] M. Veloso,et al. Nonlinear Planning with Parallel Resource Allocation , 1990 .
[52] Michel Barbeau,et al. Planning Control Rules for Reactive Agents , 1997, Artif. Intell..
[53] Craig A. Knoblock,et al. Combining the Expressivity of UCPOP with the Efficiency of Graphplan , 1997, ECP.
[54] Stephen F. Smith,et al. Knowledge-based production management approaches, results and prospects , 1992 .
[55] Jean-Claude Latombe,et al. Numerical potential field techniques for robot path planning , 1991, Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments.
[56] Achim Knoch,et al. Expertensysteme in der Verfahrenstechnik — Konfiguration von Rührapparaten , 1993 .
[57] Dennis Heimbigner,et al. Does Configuration Management Research Have a Future? , 1995, SCM.
[58] Charles W. Warren,et al. Multiple robot path coordination using artificial potential fields , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[59] Jean-Yves Potvin,et al. Heuristic approaches to vehicle routing with backhauls and time windows , 1996, Comput. Oper. Res..
[60] Drew McDermott,et al. The 1998 AI Planning Systems Competition , 2000, AI Mag..
[61] Jana Koehler,et al. Elevator Control as a Planning Problem , 2000, AIPS.
[62] Henry A. Kautz,et al. State-space Planning by Integer Optimization , 1999, AAAI/IAAI.
[63] Sérgio Vale Aguiar Campos,et al. Symbolic Model Checking , 1993, CAV.
[64] Juha Savolainen,et al. Feature Interaction and Dependencies: Modeling Features for Reengineering a Legacy Product Line , 2002, SPLC.
[65] Rachid Alami,et al. An extension of the plan-merging paradigm for multi-robot coordination , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).
[66] Tomás Lozano-Pérez,et al. On multiple moving objects , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[67] Susan A. Dart,et al. Concepts in configuration management systems , 1991, SCM '91.
[68] Maria Fox,et al. Hybrid STAN: Identifying and Managing Combinatorial Optimisation Sub- problems in Planning , 2001, IJCAI.
[69] Michael Charles Mchenry. Slice-based path planning , 1998 .
[70] Ivan Serina,et al. LPG: A Planner Based on Local Search for Planning Graphs with Action Costs , 2002, AIPS.
[71] Jean-Claude Latombe,et al. A Monte-Carlo algorithm for path planning with many degrees of freedom , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[72] Maria Fox,et al. The Automatic Inference of State Invariants in TIM , 1998, J. Artif. Intell. Res..
[73] M. Fourman. Propositional Planning , 2000 .
[74] Patrik Haslum,et al. Admissible Heuristics for Optimal Planning , 2000, AIPS.
[75] Shlomo Zilberstein,et al. LAO*: A heuristic search algorithm that finds solutions with loops , 2001, Artif. Intell..
[76] Stefan Edelkamp,et al. Implementing HEAPSORT with (n logn - 0.9n) and QUICKSORT with (n logn + 0.2n) comparisons , 2002, JEAL.
[77] Tomás Lozano-Pérez,et al. Deadlock-free and collision-free coordination of two robot manipulators , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[78] Malte Helmert,et al. Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length , 1999, ECP.
[79] Malte Helmert,et al. On the Implementation of MIPS , 2000 .
[80] Tomi Männistö,et al. Product Configuration View to Software Product Families , 2001 .
[81] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[82] Piergiorgio Bertoli,et al. Heuristic Search + Symbolic Model Checking = Efficient Conformant Planning , 2001, IJCAI.
[83] Stephen F. Smith,et al. Reconfigurable architectures for mixed-initiative planning and scheduling , 1998 .
[84] B. Faverjon,et al. Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .
[85] Malte Helmert,et al. Decidability and Undecidability Results for Planning with Numerical State Variables , 2002, PuK.
[86] Andreas Günter,et al. Knowledge-Based Configuration: Survey and Future Directions , 1999, XPS.
[87] Robert E. Bixby,et al. MIP: Theory and Practice - Closing the Gap , 1999, System Modelling and Optimization.
[88] Richard Fikes,et al. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.
[89] Frank Reffel,et al. OBDDs in Heuristic Search , 1998, KI.
[90] Hans P. Moravec,et al. High resolution maps from wide angle sonar , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.
[91] Patrick Doherty,et al. TALplanner: A Temporal Logic-Based Planner , 2001, AI Mag..
[92] Edmund M. Clarke,et al. Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..
[93] Malte Helmert,et al. The Model Checking Integrated Planning System (MIPS) , 2001 .
[94] Stephen F. Smith,et al. Toward the Development of Flexible Mixed-Initiative Scheduling Tools , 1999 .
[95] Karol Frühauf,et al. Software Configuration Management: State of the Art, State of the Practice , 1999, SCM.
[96] Stephen F. Smith,et al. Configurable, Mixed-Initiative Systems for Planning and Scheduling , 1996 .
[97] Andrés Gómez de Silva Garza,et al. The Adaptation of Structural System Designs Using Genetic Algorithms , 1996 .
[98] Jussi Rintanen,et al. An Iterative Algorithm for Synthesizing Invariants , 2000, AAAI/IAAI.
[99] Stefan Edelkamp,et al. Directed explicit-state model checking in the validation of communication protocols , 2004, International Journal on Software Tools for Technology Transfer.
[100] Manuela M. Veloso,et al. SetA*: an efficient BDD-based heuristic search algorithm , 2002, AAAI/IAAI.
[101] Steffen Hölldobler,et al. Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams , 2000, Computational Logic.
[102] Jürgen Sauer,et al. Knowledge-Based Scheduling Systems in Industry and Medicine , 1997, IEEE Expert.
[103] Stefan Edelkamp. Directed symbolic exploration and its application to AI-planning , 2001 .
[104] Maria Fox,et al. Extending the Exploitation of Symmetries in Planning , 2002, AIPS.
[105] Stephan Merz,et al. Model Checking , 2000 .
[106] Jürgen Dorn,et al. Scheduling of production processes , 1993 .
[107] Zhengzhu Feng,et al. Symbolic heuristic search for factored Markov decision processes , 2002, AAAI/IAAI.
[108] Stefan Edelkamp,et al. Symbolic Pattern Databases in Heuristic Search Planning , 2002, AIPS.
[109] Fausto Giunchiglia,et al. Planning as Model Checking , 1999, ECP.
[110] Manfred H. Pahl,et al. Software zur wissensbasierten Prozessmodellierung – WIP , 2001 .
[111] Bernhard Nebel,et al. The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..
[112] Jörg Homberger,et al. Zwei Evolutionsstrategien für das Standardproblem der Tourenplanung mit Zeitfensterrestriktionen , 1998 .
[113] Jörg Hoffmann,et al. Extending FF to Numerical State Variables , 2002, ECAI.
[114] Christer Bäckström. Computational Aspects of Reordering Plans , 1998, J. Artif. Intell. Res..
[115] William J. Clancey,et al. Heuristic Classification , 1986, Artif. Intell..
[116] Hector Geffner,et al. Heuristic Planning with Time and Resources , 2014 .
[117] Reijo Sulonen,et al. MODELING CONFIGURABLE PRODUCT FAMILIES , 1998 .
[118] Steven M. LaValle,et al. Optimal motion planning for multiple robots having independent goals , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[119] Benno Stein,et al. Functional models in configuration systems , 1995 .
[120] David B. Shmoys,et al. A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem , 1996, IPCO.
[121] Jan Bosch,et al. On the notion of variability in software product lines , 2001, Proceedings Working IEEE/IFIP Conference on Software Architecture.
[122] Bernhard Nebel,et al. COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..
[123] Zhengzhu Feng,et al. Symbolic Heuristic Search Using Decision Diagrams , 2002, SARA.
[124] Edwin P. D. Pednault,et al. ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.
[125] Jörg Hoffmann,et al. Local Search Topology in Planning Benchmarks: An Empirical Analysis , 2001, IJCAI.
[126] Jörg Hoffmann. Local Search Topology in Planning Benchmarks: A Theoretical Analysis , 2002, PuK.
[127] Christian Kühn,et al. Modeling Strucutre and Behaviour for Knowledge Based Software Configuration , 2000, PuK.
[128] Bernhard Nebel. What Is the Expressive Power of Disjunctive Preconditions? , 1999, ECP.
[129] Lydia E. Kavraki,et al. Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..
[130] Jj Org Hoomann. A Heuristic for Domain Independent Planning and its Use in an Enforced Hill-climbing Algorithm , 2000 .
[131] Oliver,et al. EngCon-Engineering & Configuration , 2003 .
[132] David J. Murray-Smith,et al. Continuous System Simulation , 1994 .
[133] B. Gaines. General systems research : quo vadis ? , 1981 .
[134] Marco Pistore,et al. Planning with a language for extended goals , 2002, AAAI/IAAI.
[135] Volker Haarslev,et al. Consistency Testing: The RACE Experience , 2000, TABLEAUX.
[136] Paolo Traverso,et al. Automatic OBDD-Based Generation of Universal Plans in Non-Deterministic Domains , 1998, AAAI/IAAI.
[137] Benno Stein,et al. Model Construction in Analysis and Synthesis Tasks , 2001 .
[138] Jun Ota,et al. Multirobot motion coordination in space and time , 1998, Robotics Auton. Syst..
[139] Stephen J. Buckley,et al. Fast motion planning for multiple moving robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.
[140] Jussi Rintanen,et al. Numeric State Variables in Constraint-Based Planning , 1999, ECP.
[141] S. Edelkamp,et al. Deterministic State Space Planning with BDDs , 1999 .
[142] Craig A. Knoblock. Generating Parallel Execution Plans with a Partial-order Planner , 1994, AIPS.
[143] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..
[144] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[145] Axel Brinkop,et al. Routine Design for Mechanical Engineering , 1995, AI Mag..
[146] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[147] Fahiem Bacchus,et al. Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..
[148] Shlomo Zilberstein,et al. Approximate Reasoning Using Anytime Algorithms , 1995 .
[149] Maria Fox,et al. PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..
[150] George Boolos,et al. Computability and logic , 1974 .
[151] Rainer Herrler,et al. OntHoS — an Ontology for Hospital Scenarios , 2003 .