default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDICAPS 2017: Pittsburgh, Pennsylvania, USA
- Laura Barbulescu, Jeremy Frank, Mausam, Stephen F. Smith:
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, ICAPS 2017, Pittsburgh, Pennsylvania, USA, June 18-23, 2017. AAAI Press 2017
Main Track
- Mohammad Abdulaziz
, Charles Gretton, Michael Norrish:
A State-Space Acyclicity Property for Exponentially Tighter Plan Length Bounds. 2-10 - Masataro Asai, Alex Fukunaga:
Exploration among and within Plateaus in Greedy Best-First Search. 11-19 - Gregor Behnke, Daniel Höller, Susanne Biundo:
This Is a Solution! (... But Is It Though?) - Verifying Solutions of Hierarchical Planning Problems. 20-28 - Sara Bernardini, Maria Fox, Derek Long, Chiara Piacentini:
Boosting Search Guidance in Problems with Semantic Attachments. 29-37 - Blai Bonet, Gabriel Formica, Melecio Ponte:
Completeness of Online Planners for Partially Observable Deterministic Tasks. 38-46 - Amanda Jane Coles, Andrew Ian Coles:
A Temporal Relaxed Planning Graph Heuristic for Planning with Envelopes. 47-55 - Bence Cserna, Wheeler Ruml, Jeremy Frank:
Planning Time to Think: Metareasoning for On-Line Planning with Durative Actions. 56-60 - Jing Cui, Patrik Haslum:
Dynamic Controllability of Controllable Conditional Temporal Problems with Uncertainty. 61-69 - Louis Dressel, Mykel J. Kochenderfer:
Efficient Decision-Theoretic Target Localization. 70-78 - Jürgen Eckerle, Jingwei Chen, Nathan R. Sturtevant, Sandra Zilles, Robert C. Holte:
Sufficient Conditions for Node Expansion in Bidirectional Heuristic Search. 79-87 - Salomé Eriksson, Gabriele Röger, Malte Helmert:
Unsolvability Certificates for Classical Planning. 88-97 - Gaojian Fan, Martin Müller, Robert Holte:
The Two-Edged Nature of Diverse Action Costs. 98-106 - Maximilian Fickert, Jörg Hoffmann:
Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement. 107-115 - Nicola Gigante, Angelo Montanari, Marta Cialdea Mayer, Andrea Orlandini:
Complexity of Timeline-Based Planning. 116-124 - Daniel Gnad, Álvaro Torralba, Alexander Shleyfman, Jörg Hoffmann:
Symmetry Breaking in Star-Topology Decoupled Search. 125-134 - Stephan Gocht, Tomás Balyo:
Accelerating SAT Based Planning with Incremental SAT Solving. 135-139 - Miguel Ángel González, Angelo Oddi, Riccardo Rasconi:
Multi-Objective Optimization in a Job Shop with Energy Costs through Hybrid Evolutionary Techniques. 140-148 - Carlos Hernández, Jorge A. Baier:
Improving MPGAA* for Extended Visibility Ranges. 149-153 - Hsu-Chieh Hu, Stephen F. Smith:
Coping with Large Traffic Volumes in Schedule-Driven Traffic Signal Control. 154-162 - Erez Karpas, Alexander Shleyfman, Moshe Tennenholtz:
Automated Verification of Social Law Robustness in STRIPS. 163-171 - Michael Katz, Nir Lipovetzky, Dany Moshkovich, Alexander Tuisov:
Adapting Novelty to Classical Planning as Heuristic Search. 172-180 - Shamin Kinathil, Harold Soh, Scott Sanner:
Analytic Decision Analysis via Symbolic Dynamic Programming for Parameterized Hybrid MDPs. 181-185 - Filippos Kominis, Hector Geffner:
Multiagent Online Planning with Nested Beliefs and Dialogue. 186-194 - Nir Lipovetzky, Hector Geffner:
A Polynomial Planning Algorithm that Beats LAMA and FF. 195-199 - Meghna Lowalekar, Pradeep Varakantham, Supriyo Ghosh, Sanjay Dominik Jena, Patrick Jaillet:
Online Repositioning in Bike Sharing Systems. 200-208 - Shlomi Maliah, Ronen I. Brafman, Guy Shani:
Increased Privacy with Reduced Communication in Multi-Agent Planning. 209-217 - Shuwa Miura, Alex Fukunaga:
Automatic Extraction of Axioms for Planning. 218-227 - Florian Pommerening, Malte Helmert, Blai Bonet:
Abstraction Heuristics, Cost Partitioning and Network Flows. 228-232 - Srikumar Ramalingam, Arvind U. Raghunathan, Daniel Nikovski:
Submodular Function Maximization for Group Elevator Scheduling. 233-241 - Hadi Salman, Elif Ayvali, Howie Choset:
Multi-Agent Ergodic Coverage with Obstacle Avoidance. 242-249 - Matteo Salvetti, Adi Botea, Alessandro Saetti, Alfonso Emilio Gerevini:
Compressed Path Databases with Ordered Wildcard Substitutions. 250-258 - Jendrik Seipp, Thomas Keller, Malte Helmert:
A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning. 259-268 - Patrick Speicher, Marcel Steinmetz, Daniel Gnad, Jörg Hoffmann, Alfonso Gerevini:
Beyond Red-Black Planning: Limited-Memory State Variables. 269-273 - Simon Ståhlberg:
Tailoring Pattern Databases for Unsolvable Planning Instances. 274-282 - Marcel Steinmetz, Jörg Hoffmann:
Critical-Path Dead-End Detection versus NoGoods: Offline Equivalence and Online Learning. 283-287 - Son Thanh To, Benjamin Johnson, Mark Roberts, David W. Aha:
A New Approach to Temporal Planning with Rich Metric Temporal Properties. 288-296 - Jan Tozicka, Michal Stolba, Antonín Komenda:
The Limits of Strong Privacy Preserving Multi-Agent Planning. 297-305 - Felipe W. Trevizan, Sylvie Thiébaux, Patrik Haslum:
Occupation Measure Heuristics for Probabilistic Planning. 306-315 - Thayne T. Walker, David M. Chan, Nathan R. Sturtevant:
Using Hierarchical Constraints to Avoid Conflicts in Multi-Agent Pathfinding. 316-324 - Zhihui Wang, Bryan O'Gorman, Tony T. Tran, Eleanor Gilbert Rieffel, Jeremy Frank, Minh Do:
An Investigation of Phase Transitions in Single-Machine Scheduling Problems. 325-329 - Dominik Winterer, Yusra Alkhazraji, Michael Katz, Martin Wehrle:
Stubborn Sets for Fully Observable Nondeterministic Planning. 330-338 - Shun Zhang, Edmund H. Durfee, Satinder Singh:
Approximately-Optimal Queries for Planning in Reward-Uncertain Markov Decision Processes. 339-347 - Qi Zhang, Satinder Singh, Edmund H. Durfee:
Minimizing Maximum Regret in Commitment Constrained Sequential Decision Making. 348-357
Novel Applications Track
- Cen Chen, Zachary B. Rubinstein, Stephen F. Smith, Hoong Chuin Lau:
Tackling Large-Scale Home Health Care Delivery Problem with Uncertainty. 358-366 - Pedro M. d'Orey, José Azevedo, Michel Ferreira:
Automated Planning and Control for High-Density Parking Lots. 367-372 - Supriyo Ghosh, Pradeep Varakantham:
Incentivizing the Use of Bike Trailers for Dynamic Repositioning in Bike Sharing Systems. 373-381 - Philippe Laborie, Bilal Messaoudi:
New Results for the GEO-CAPE Observation Scheduling Problem. 382-390 - Thomas Leo McCluskey, Mauro Vallati:
Embedding Automated Planning within Urban Traffic Management Operations. 391-399 - Simon Parkinson, Andrew Longstaff, Simon Fletcher, Mauro Vallati, Lukás Chrpa:
On the Exploitation of Automated Planning for Reducing Machine Tools Energy Consumption between Manufacturing Operations. 400-408 - Tanvi Verma, Pradeep Varakantham, Sarit Kraus, Hoong Chuin Lau:
Augmenting Decisions of Taxi Drivers through Reinforcement Learning for Improving Revenues. 409-418
Planning and Learning Track
- Hany Abdulsamad, Oleg Arenz, Jan Peters, Gerhard Neumann:
State-Regularized Policy Search for Linearized Dynamical Systems. 419-424 - Tomás de la Rosa, Isabel Cenamor, Fernando Fernández:
Performance Modelling of Planners from Homogeneous Problem Sets. 425-433 - Alan Lindsay, Jonathon Read, João F. Ferreira, Thomas Hayton, Julie Porteous, Peter Gregory:
Framer: Planning Models from Natural Language Action Descriptions. 434-442 - Mohammad Hossein Namaki, F. A. Rezaur Rahman Chowdhury, Md. Rakibul Islam, Janardhan Rao Doppa, Yinghui Wu:
Learning to Speed Up Query Planning in Graph Databases. 443-451 - Javier Segovia-Aguas, Sergio Jiménez Celorrio, Anders Jonsson:
Unsupervised Classification of Planning Instances. 452-460 - Mohan Sridharan, Ben Meadows, Rocío Gómez:
What Can I Not Do? Towards an Architecture for Reasoning about and Learning Affordances. 461-470
Robotics Track
- Matthew Crosby, Ronald P. A. Petrick, Francesco Rovida, Volker Krüger:
Integrating Mission and Task Planning in an Industrial Robotics Framework. 471-479 - Nakul Gopalan, Marie desJardins, Michael L. Littman, James MacGlashan, Shawn Squire, Stefanie Tellex, John Winder, Lawson L. S. Wong:
Planning with Abstract Markov Decision Processes. 480-488 - Ludovic Hofer, Quentin Rouxel:
An Operational Method Toward Efficient Walk Control Policies for Humanoid Robots. 489-497 - Till Hofmann, Tim Niemueller, Gerhard Lakemeyer:
Initial Results on Generating Macro Actions from a Plan Database for Planning on Autonomous Mobile Robots. 498-503 - Bruno Lacerda, David Parker, Nick Hawes:
Multi-Objective Policy Generation for Mobile Robots under Probabilistic Time-Bounded Guarantees. 504-512 - Duong Le, Erion Plaku:
Cooperative Multi-Robot Sampling-Based Motion Planning with Dynamics. 513-521 - Venkatraman Narayanan, Maxim Likhachev:
Heuristic Search on Graphs with Existence Priors for Expensive-to-Evaluate Edges. 522-530 - Oren Salzman, Brian Hou, Siddhartha S. Srinivasa:
Efficient Motion Planning for Problems Lacking Optimal Substructure. 531-539 - Valerio Sanelli, Michael Cashmore, Daniele Magazzeni, Luca Iocchi:
Short-Term Human-Robot Interaction through Conditional Planning and Execution. 540-548 - Eugenio Sebastiani, Raphaël Lallement, Rachid Alami, Luca Iocchi:
Dealing with On-line Human-Robot Negotiations in Hierarchical Agent-Based Task Planner. 549-557 - Breelyn Melissa Kane Styler, Reid G. Simmons:
Plan-Time Multi-Model Switching for Motion Planning. 558-566 - Takeshi Takahashi, Michael William Lanighan, Roderic A. Grupen:
Hybrid Task Planning Grounded in Belief: Constructing Physical Copies of Simple Structures. 567-571 - Shivam Vats, Venkatraman Narayanan, Maxim Likhachev:
Learning to Avoid Local Minima in Planning for Static Environments. 572-576 - Glenn Wagner, Howie Choset:
Path Planning for Multiple Agents under Uncertainty. 577-585 - Konstantin S. Yakovlev, Anton Andreychuk:
Any-Angle Pathfinding for Multiple Agents Based on SIPP Algorithm. 586-
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.
last updated on 2025-12-04 01:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
