![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
ICAPS 2013: Rome, Italy
- Daniel Borrajo, Subbarao Kambhampati, Angelo Oddi, Simone Fratini:
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, ICAPS 2013, Rome, Italy, June 10-14, 2013. AAAI 2013, ISBN 978-1-57735-609-7
Full Papers
- Sergey Alatartsev, Marcus Augustine, Frank Ortmeier:
Constricting Insertion Heuristic for Traveling Salesman Problem with Neighborhoods. - James C. Boerkoel Jr., Léon Planken, Ronald Wilcox, Julie A. Shah:
Distributed Algorithms for Incrementally Maintaining Multiagent Simple Temporal Networks. - Adi Botea, Evdokia Nikolova, Michele Berlingerio:
Multi-Modal Journey Planning in the Presence of Uncertainty. - Michael Cashmore, Maria Fox, Enrico Giunchiglia:
Partially Grounded Planning as Quantified Boolean Formula. - Amanda Jane Coles, Andrew Coles:
Searching for Good Solutions in Goal-Dense Search Spaces. - Matt Crosby, Michael Rovatsos, Ronald P. A. Petrick:
Automated Agent Decomposition for Classical Planning. - Richard Dearden, Chris Burbridge:
An Approach for Efficient Planning of Robotic Manipulation Tasks. - Carmel Domshlak:
Fault Tolerant Planning: Complexity and Compilation. - Masood Feyzbakhsh Rankooh
, Gholamreza Ghassem-Sani:
New Encoding Methods for SAT-Based Temporal Planning. - Kalin Gochev, Alla Safonova, Maxim Likhachev:
Incremental Planning with Adaptive Dimensionality. - Miguel A. González, Camino R. Vela, Ramiro Varela:
An Efficient Memetic Algorithm for the Flexible Job Shop with Setup Times. - David Leo Wright Hall, Alon Cohen, David Burkett, Dan Klein:
Faster Optimal Planning with Partial-Order Pruning. - Yuxiao Hu, Giuseppe De Giacomo:
A Generic Technique for Synthesizing Bounded Finite-State Controllers. - Anders Jonsson, Peter Jonsson, Tomas Lööw:
When Acyclicity Is Not Enough: Limitations of the Causal Graph. - Michael Katz, Jörg Hoffmann, Carmel Domshlak:
Who Said We Need to Relax All Variables? - Thomas Keller, Malte Helmert:
Trial-Based Heuristic Tree Search for Finite Horizon MDPs. - Richard E. Korf, Ethan L. Schreiber:
Optimally Scheduling Small Numbers of Identical Parallel Machines. - Vitaly Mirkis, Carmel Domshlak:
Abstractions for Oversubscription Planning. - Florian Pommerening, Malte Helmert:
Incremental LM-Cut. - Cédric Pralet, Gérard Verfaillie:
Dynamic Online Planning and Scheduling Using a Static Invariant-Based Evaluation Model. - Miquel Ramírez, Nitin Yadav, Sebastian Sardiña:
Behavior Composition as Fully Observable Non-Deterministic Planning. - Jussi Rintanen:
Scheduling with Contingent Resources and Tasks. - Ran Taig, Ronen I. Brafman:
Compiling Conformant Probabilistic Planning Problems into Classical Planning. - Álvaro Torralba
, Stefan Edelkamp, Peter Kissmann:
Transition Trees for Cost-Optimal Symbolic Planning. - Tony T. Tran, Daria Terekhov, Douglas G. Down, J. Christopher Beck:
Hybrid Queueing Theory and Scheduling Models for Dynamic Environments with Sequence-Dependent Setup Times. - Tansel Uras, Sven Koenig, Carlos Hernández:
Subgoal Graphs for Optimal Pathfinding in Eight-Neighbor Grids. - Richard Anthony Valenzano, Shahab Jabbari Arfaee, Jordan Tyler Thayer, Roni Stern, Nathan R. Sturtevant:
Using Alternative Suboptimality Bounds in Heuristic Search. - Håkan Warnquist, Jonas Kvarnström, Patrick Doherty:
Exploiting Fully Observable and Deterministic Structures in Goal POMDPs. - Martin Wehrle, Malte Helmert, Yusra Alkhazraji, Robert Mattmüller:
The Relative Pruning Power of Strong Stubborn Sets and Expansion Core. - Stefan J. Witwicki, Francisco S. Melo, Jesús Capitán, Matthijs T. J. Spaan:
A Flexible Approach to Modeling Unpredictable Events in MDPs. - Fan Xie, Richard Anthony Valenzano, Martin Müller:
Better Time Constrained Search via Randomization and Postprocessing.
Short Papers
- Oliver Avalos-Rosales, Ada Margarita Alvarez, Francisco Ángel-Bello:
A Reformulation for the Problem of Scheduling Unrelated Parallel Machines with Sequence and Machine Dependent Setup Times. - Alessio Bonfietti, Michele Lombardi, Michela Milano:
De-Cycling Cyclic Scheduling Problems. - Adi Botea, Jorge A. Baier, Daniel Harabor, Carlos Hernández:
Moving Target Search with Compressed Path Databases. - Adi Botea, Daniel Harabor:
Path Planning with Compressed All-Pairs Shortest Paths Data. - Carmel Domshlak, Michael Katz, Alexander Shleyfman:
Symmetry Breaking: Satisficing Planning and Landmark Heuristics. - Patrick Eyerich, Malte Helmert:
Stronger Abstraction Heuristics Through Perimeter Search. - Daniel Damir Harabor, Alban Grastien:
An Optimal Any-Angle Pathfinding Algorithm. - Patrik Haslum:
Heuristics for Bounded-Cost Search. - Patrik Haslum, Malte Helmert, Anders Jonsson:
Safe, Strong, and Tractable Relevance Analysis for Planning. - Brian King, Alan Fern, Jesse Hostetler:
On Adversarial Policy Switching with Experiments in Real-Time Strategy Games. - Peter Kissmann, Jörg Hoffmann:
What's in It for My BDD? On Causal Graphs and Variable Orders in Planning. - Johannes Löhr, Patrick Eyerich, Stefan Winkler, Bernhard Nebel:
Domain Predictive Control Under Uncertain Numerical State Information. - Mikael Nilsson, Jonas Kvarnström, Patrick Doherty:
Incremental Dynamic Controllability Revisited. - Aldo Porco, Alejandro Machado, Blai Bonet:
Automatic Reductions from PH into STRIPS or How to Generate Short Problems with Very Long Solutions. - Jendrik Seipp, Malte Helmert:
Counterexample-Guided Cartesian Abstraction Refinement.
Novel Applications Special Track
- Sara Bernardini, Maria Fox, Derek Long, John Bookless:
Autonomous Search and Tracking via Temporal Planning. - Sara Bernardini, Kaska Porayska-Pomsta:
Planning-Based Social Partners for Children with Autism. - Gabriella Cortellessa, Riccardo De Benedictis, Marco Pagani:
Timeline-Based Planning for Engaging Training Experiences. - Daniel Le Berre, Pierre Marquis, Stéphanie Roussel:
Planning Personalised Museum Visits. - Ronald P. A. Petrick, Mary Ellen Foster:
Planning for Social Interaction in a Robot Bartender Domain. - Chiara Piacentini, Varvara Alimisis, Maria Fox, Derek Long:
Combining a Temporal Planner with an External Solver for the Power Balancing Problem in an Electricity Network. - Nicola Policella, Henrique Oliveira, Edoardo Benzi:
Planning Spacecraft Activities: An Automated Approach. - Kameshwaran Sampath, Alfiya Tezabwala, Alain Chabrier, Julain Payne, Fabio Tiozzo:
Integrated Operations (Re-)Scheduling from Mine to Ship. - Joris Scharpff, Matthijs T. J. Spaan, Leentje Volker, Mathijs de Weerdt:
Planning under Uncertainty for Coordinating Infrastructural Maintenance. - Stephen F. Smith, Gregory J. Barlow, Xiao-Feng Xie, Zachary B. Rubinstein:
Smart Urban Signal Networks: Initial Application of the SURTRAC Adaptive Traffic Signal Control System. - Shirin Sohrabi, Octavian Udrea, Anand Ranganathan, Anton Riabov:
HTN Planning for the Composition of Stream Processing Applications. - Joshua Campion, Chris J. Dent, Maria Fox, Derek Long, Daniele Magazzeni:
Challenge: Modelling Unit Commitment as a Planning Problem. - András Kovács:
Task Sequencing for Remote Laser Welding in the Automotive Industry. - David Pattison, Wenbin Xie, Francis Quail:
The Windy Domain - A Challenging Real-World Application of Integrated Planning and Scheduling.
Journal Presentation Track
- Alessandro Armando, Enrico Giunchiglia, Marco Maratea, Serena Elisa Ponta:
Modeling and Reasoning about Business Processes under Authorization Constraints: A Planning-Based Approach. - Jeremy Frank:
Planning Solar Array Operations on the International Space Station. - Hilbert J. Kappen, Vicenç Gómez, Manfred Opper:
Optimal Control as a Graphical Model Inference Problem. - Daniel J. Lizotte, Michael Bowling, Susan A. Murphy:
Linear Fitted-Q Iteration with Multiple Reward Functions. - Michele Lombardi, Michela Milano:
A Min-Flow Algorithm for Minimal Critical Set Detection in Resource Constrained Project Scheduling. - Arnaud Malapert, Hadrien Cambazard, Christelle Guéret, Narendra Jussien, André Langevin, Louis-Martin Rousseau:
An Optimal Constraint Programming Approach to the Open-Shop Problem. - Masahiro Ono, Brian C. Williams, Lars Blackmore:
Paper Summary: Probabilistic Planning for Continuous Dynamic Systems under Bounded Risk. - Federico Pecora, Marcello Cirillo, Francesca Dell'Osa, Jonas Ullberg, Alessandro Saffiotti:
A Constraint-Based Approach for Proactive, Context-Aware Human Support. - Paulo E. Santos, Pedro Cabalar:
An Investigation of Actions, Change and Space. - David Silver, Richard S. Sutton, Martin Müller:
Temporal-Difference Search in Computer Go. - David C. Uthus, Patricia J. Riddle, Hans W. Guesgen:
Solving the Traveling Tournament Problem with Iterative-Deepening A.
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.