default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th ICAPS 2019: Berkeley, CA, USA
- J. Benton, Nir Lipovetzky, Eva Onaindia, David E. Smith, Siddharth Srivastava:
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, ICAPS 2019, Berkeley, CA, USA, July 11-15, 2019. AAAI Press 2019
Main Track
- Jordan R. Abrahams, David A. Chu, Grace Diehl, Marina Knittel, Judy Lin, William Lloyd, James C. Boerkoel Jr., Frank Jeremy:
DREAM: An Algorithm for Mitigating the Overhead of Robust Rescheduling. 3-12 - Diego Aineto, Sergio Jiménez, Eva Onaindia, Miquel Ramírez:
Model Recognition as Planning. 13-21 - Shyan Akmal, Savana Ammons, Hemeng Li, James C. Boerkoel Jr.:
Quantifying Degrees of Controllability in Temporal Networks with Uncertainty. 22-30 - Benjamin Aminof, Giuseppe De Giacomo, Aniello Murano, Sasha Rubin:
Planning under LTL Environment Specifications. 31-39 - Vitaliy Batusov, Mikhail Soutchanski:
A Logical Semantics for PDDL+. 40-48 - Arthur Bit-Monnot, Luca Pulina, Armando Tacchella:
Cyber-Physical Planning: Deliberation for Hybrid Systems with a Continuous Numeric State. 49-57 - Alberto Camacho, Meghyn Bienvenu, Sheila A. McIlraith:
Towards a Unified View of AI Planning and Reactive Synthesis. 58-67 - Jean Carpentier, Sebastien Blandin:
Approximate Gradient Descent Convergence Dynamics for Adaptive Control on Heterogeneous Networks. 68-76 - Margarita P. Castro, Chiara Piacentini, André A. Ciré, J. Christopher Beck:
Relaxed BDDs: An Admissible Heuristic for Delete-Free Planning Based on a Discrete Relaxation. 77-85 - Tathagata Chakraborti, Anagha Kulkarni, Sarath Sreedharan, David E. Smith, Subbarao Kambhampati:
Explicability? Legibility? Predictability? Transparency? Privacy? Security? The Emerging Landscape of Interpretable Agent Behavior. 86-96 - Jingkai Chen, Cheng Fang, David Wang, Andrew J. Wang, Brian C. Williams:
Efficiently Exploring Ordering Problems through Conflict-Directed Search. 97-105 - Mattia Chiari, Shizhe Zhao, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti, Matteo Salvetti, Peter J. Stuckey:
Cutting the Size of Compressed Path Databases with Wildcards and Redundant Symbols. 106-113 - Augusto B. Corrêa, Florian Pommerening:
An Empirical Study of Perfect Potential Heuristics. 114-118 - Hao Cui, Thomas Keller, Roni Khardon:
Stochastic Planning with Lifted Symbolic Trajectory Optimization. 119-127 - Giuseppe De Giacomo, Luca Iocchi, Marco Favorito, Fabio Patrizi:
Foundations for Restraining Bolts: Reinforcement Learning with LTLf/LDLf Restraining Specifications. 128-136 - Elad Denenberg, Amanda Jane Coles:
Mixed Discrete Continuous Non-Linear Planning through Piecewise Linear Approximation. 137-145 - Valdinei Freire, Karina Valdivia Delgado, Willy Arthur Silva Reis:
An Exact Algorithm to Make a Trade-Off between Cost and Probability in SSPs. 146-154 - Graeme Gange, Daniel Harabor, Peter J. Stuckey:
Lazy CBS: Implicit Conflict-Based Search Using Lazy Clause Generation. 155-162 - Alfonso Emilio Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti, Ivan Serina:
Best-First Width Search for Multi Agent Privacy-Preserving Planning. 163-171 - Daniel Gnad, Jörg Hoffmann:
On the Relation between Star-Topology Decoupling and Petri Net Unfolding. 172-180 - Florian Grenouilleau, Willem-Jan van Hoeve, John N. Hooker:
A Multi-Label A* Algorithm for Multi-Agent Pathfinding. 181-185 - Lei He, Mathijs de Weerdt, Neil Yorke-Smith:
Tabu-Based Large Neighbourhood Search for Time/Sequence-Dependent Scheduling Problems with Time Windows. 186-194 - Alexander Heinz, Martin Wehrle, Sergiy Bogomolov, Daniele Magazzeni, Marius Greitschus, Andreas Podelski:
Temporal Planning as Refinement-Based Model Checking. 195-199 - Hsu-Chieh Hu, Stephen F. Smith:
Using Bi-Directional Information Exchange to Improve Decentralized Schedule-Driven Traffic Control. 200-208 - Yue Hu, Daniel Harabor, Long Qin, Quanjun Yin, Cong Hu:
Improving the Combination of JPS and Geometric Containers. 209-213 - Xin Huang, Sungkweon Hong, Andreas G. Hofmann, Brian C. Williams:
Online Risk-Bounded Motion Planning for Autonomous Vehicles in Dynamic Environments. 214-222 - Luke Hunsberger, Roberto Posenato:
Propagating Piecewise-Linear Weights in Temporal Networks. 223-231 - Franc Ivankovic, Dan Gordon, Patrik Haslum:
Planning with Global State Constraints and State-Dependent Action Costs. 232-236 - Michael Katz, Emil Keyder, Dominik Winterer, Florian Pommerening:
Oversubscription Planning as Classical Planning with Multiple Cost Functions. 237-245 - Sarah Keren, Luis Enrique Pineda, Avigdor Gal, Erez Karpas, Shlomo Zilberstein:
Efficient Heuristic Search for Optimal Environment Redesign. 246-254 - Ryo Kuroiwa, Alex Fukunaga:
On the Pathological Search Behavior of Distributed Greedy Best-First Search. 255-263 - Joon Young Lee, Vivaswat Ojha, James C. Boerkoel Jr.:
Measuring and Optimizing Durability against Scheduling Disturbances. 264-268 - Jun-Ho Lee, Hyun-Jung Kim:
Backward Sequence Analysis for Single-Armed Cluster Tools. 269-272 - Jiaoyang Li, Ariel Felner, Sven Koenig, T. K. Satish Kumar:
Using FastMap to Solve Graph Problems in a Euclidean Space. 273-278 - Jiaoyang Li, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Disjoint Splitting for Multi-Agent Path Finding with Conflict-Based Search. 279-283 - Jean Massardi, Mathieu Gravel, Eric Beaudry:
Error-Tolerant Anytime Approach to Plan Recognition Using a Particle Filter. 284-291 - Grigory Neustroev, Mathijs de Weerdt, Remco A. Verzijlbergh:
Discovery of Optimal Solution Horizons in Non-Stationary Markov Decision Processes with Unbounded Rewards. 292-300 - Giancarlo Nicolò, Sergio Ferrer, Miguel A. Salido, Adriana Giret, Federico Barber:
A Multi-Agent Framework to Solve Energy-Aware Unrelated Parallel Machine Scheduling Problems with Machine-Dependent Energy Consumption and Sequence-Dependent Setup Time. 301-309 - Conny Olz, Pascal Bercher:
Eliminating Redundant Actions in Partially Ordered Plans - A Complexity Analysis. 310-319 - Francesco Percassi, Alfonso Emilio Gerevini:
On Compiling Away PDDL3 Soft Trajectory Constraints without Using Automata. 320-328 - Ramon Fraga Pereira, André Grahl Pereira, Felipe Meneguzzi:
Landmark-Enhanced Heuristics for Goal Recognition in Incomplete Domain Models. 329-337 - Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin:
Lagrangian Decomposition for Optimal Cost Partitioning. 338-347 - Alberto Pozanco, Yolanda E-Martín, Susana Fernández, Daniel Borrajo:
Finding Centroids and Minimum Covering States in Planning. 348-352 - Franco Quezada, Céline Gicquel, Safia Kedad-Sidhoum:
A Stochastic Dual Dynamic Integer Programming for the Uncapacitated Lot-Sizing Problem with Uncertain Demand and Costs. 353-361 - Alexander Rovner, Silvan Sievers, Malte Helmert:
Counterexample-Guided Abstraction Refinement for Pattern Selection in Optimal Classical Planning. 362-367 - Michael Saint-Guillain:
Robust Operations Management on Mars. 368-376 - Frederik Schmitt, Daniel Gnad, Jörg Hoffmann:
Advanced Factoring Strategies for Decoupled Search Using Linear Programming. 377-381 - Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomás Balyo:
Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning. 382-390 - Jendrik Seipp, Malte Helmert:
Subset-Saturated Cost Partitioning for Optimal Classical Planning. 391-400 - Arik Senderovich, Kyle E. C. Booth, J. Christopher Beck:
Learning Scheduling Models from Event Data. 401-409 - Apoorva Sharma, James Harrison, Matthew Tsao, Marco Pavone:
Robust and Adaptive Planning under Model Uncertainty. 410-418 - Shashank Shekhar, Ronen I. Brafman, Guy Shani:
A Factored Approach to Deterministic Contingent Multi-Agent Planning. 419-427 - Alexander Shleyfman:
On Computational Complexity of Automorphism Groups in Classical Planning. 428-436 - Shahaf S. Shperberg, Solomon Eyal Shimony, Avinoam Yehezkel:
Algorithm Selection in Optimization and Application to Angry Birds. 437-445 - Silvan Sievers, Gabriele Röger, Martin Wehrle, Michael Katz:
Theoretical Foundations for Structural Symmetries of Lifted PDDL Tasks. 446-454 - Rui Silva, Gabriele Farina, Francisco S. Melo, Manuela Veloso:
A Theoretical and Algorithmic Analysis of Configurable MDPs. 455-463 - David Speck, Florian Geißer, Robert Mattmüller, Álvaro Torralba
:
Symbolic Planning with Axioms. 464-472 - Marcel Steinmetz, Álvaro Torralba:
Bridging the Gap between Abstractions and Critical-Path Heuristics via Hypergraphs. 473-481 - Michal Stolba, Daniel Fiser, Antonín Komenda:
Privacy Leakage of Search-Based Multi-Agent Planning Algorithms. 482-490
Novel Applications
- Fares K. Alaboud, Andrew Coles:
Personalized Medication and Activity Planning in PDDL+. 492-500 - Wayne Chi, Jagriti Agrawal, Steve A. Chien, Elyse Fosse, Usha Guduri:
Optimizing Parameters for Uncertain Execution and Rescheduling Robustness. 501-509 - Fabian Feitsch, Sabine Storandt:
The Clustered Dial-a-Ride Problem. 510-518 - Lucas Kletzander, Nysret Musliu, Johannes Gärtner, Thomas Krennwallner, Werner Schafhauser:
Exact Methods for Extended Rotating Workforce Scheduling Problems. 519-527 - Meghna Lowalekar, Pradeep Varakantham, Patrick Jaillet:
ZAC: A Zone Path Construction Approach for Effective Real-Time Ridesharing. 528-538 - Leanne Monchuk, Simon Parkinson, James Kitchen:
Towards Automating Crime Prevention through Environmental Design (CPTED) Analysis to Predict Burglary. 539-547 - Jannik Peters, Daniel Stephan, Isabel Amon, Hans Gawendowicz, Julius Lischeid, Lennart Salabarria, Jonas Umland, Felix Werner, Martin S. Krejca, Ralf Rothenberger, Timo Kötzing, Tobias Friedrich:
Mixed Integer Programming versus Evolutionary Computation for Optimizing a Hard Real-World Staff Assignment Problem. 541-554 - Anil Sharma, Saket Anand, Sanjit K. Kaul:
Reinforcement Learning Based Querying in Camera Networks for Efficient Target Tracking. 555-563 - Tiago Vaquero, Steve A. Chien, Jagriti Agrawal, Wayne Chi, Terrance L. Huntsberger:
Temporal Brittleness Analysis of Task Networks for Planetary Rovers. 564-572 - Felix Winter, Nysret Musliu, Emir Demirovic, Christoph Mrkvicka:
Solution Approaches for an Automotive Paint Shop Scheduling Problem. 573-581
Planning and Learning
- Masataro Asai:
Unsupervised Grounding of Plannable First-Order Logic Representation from Images. 583-591 - Masataro Asai, Hiroshi Kajino:
Towards Stable Symbol Grounding with Zero-Suppressed State AutoEncoder. 592-600 - Bahram Behzadian, Soheil Gharatappeh, Marek Petrik:
Fast Feature Selection for Linear Value Function Approximation. 601-609 - Abhinav Bhatia, Pradeep Varakantham, Akshat Kumar:
Resource Constrained Deep Reinforcement Learning. 610-620 - Alberto Camacho, Sheila A. McIlraith:
Learning Interpretable Models Expressed in Linear Temporal Logic. 621-630 - Sankalp Garg, Aniket Bajpai, Mausam:
Size Independent Neural Transfer for RDDL Planning. 631-636 - Pawel Gomoluch, Dalal Alrajeh, Alessandra Russo:
Learning Classical Planning Strategies with Policy Gradient. 637-645 - Miquel Junyent, Anders Jonsson, Vicenç Gómez:
Deep Policies for Width-Based Planning in Pixel Domains. 646-654 - Tanvi Verma, Pradeep Varakantham, Hoong Chuin Lau:
Entropy Based Independent Learning in Anonymous Multi-Agent Settings. 655-663
Robotics
- Michael Cashmore, Andrew Coles, Bence Cserna, Erez Karpas, Daniele Magazzeni, Wheeler Ruml:
Replanning for Situated Robots. 665-673 - Ishani Chatterjee, Maxim Likhachev, Ashwin Khadke, Manuela Veloso:
Speeding Up Search-Based Motion Planning via Conservative Heuristics. 674-679 - Arthur Clavière, Souradeep Dutta, Sriram Sankaranarayanan:
Trajectory Tracking Control for Robotic Vehicles Using Counterexample Guided Training of Neural Networks. 680-688 - Kevin Denis, Johan Philips, Herman Bruyninckx, Eric Demeester:
Clothoidal Local Path Template for Intention Estimation by Assistive Mobile Robots. 689-697 - Marcus Hörger, Joshua Song, Hanna Kurniawati, Alberto Elfes:
POMDP-Based Candy Server: Lessons Learned from a Seven Day Demo. 698-706 - Joshua Vander Hook, Tiago Vaquero, Federico Rossi, Martina Troesch, Marc Sanchez Net, Joshua Schoolcraft, Jean-Pierre de la Croix, Steve A. Chien:
Mars On-Site Shared Analytics Information and Computing. 707-715 - Fahad Islam, Oren Salzman, Maxim Likhachev:
Provable Indefinite-Horizon Real-Time Planning for Repetitive Tasks. 716-724 - Yuqian Jiang, Nick Walker, Justin W. Hart, Peter Stone:
Open-World Reasoning for Service Robots. 725-733 - Sung-Kyun Kim, Oren Salzman, Maxim Likhachev:
POMHDP: Search-Based Belief Space Planning Using Multiple Heuristics. 734-744 - Aditya Mandalika, Sanjiban Choudhury, Oren Salzman, Siddhartha S. Srinivasa:
Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-Based Toggles. 745-753 - Tim Niemueller, Till Hofmann, Gerhard Lakemeyer:
Goal Reasoning in the CLIPS Executive for Integrated Planning and Execution. 754-763 - Takeshi Takahashi, He Sun, Dong Tian, Yebin Wang:
Learning Heuristic Functions for Mobile Robot Path Planning Using Deep Neural Networks. 764-772 - Tiago S. Veiga, Miguel Silva, Rodrigo Ventura, Pedro U. Lima:
A Hierarchical Approach to Active Semantic Mapping Using Probabilistic Logic and Information Reward POMDPs. 773-781
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-03-04 20:53 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:
