default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID34th ICAPS 2024: Banff, AB, Canada
- Sara Bernardini, Christian Muise:
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, ICAPS 2024, Banff, Alberta, Canada, June 1-6, 2024. AAAI Press 2024
Main Track
- Forest Agostinelli
, Rojina Panta, Vedant Khandelwal:
Specifying Goals to Deep Neural Networks with Answer Set Programming. 2-10 - Saman Ahmadi, Nathan R. Sturtevant, Daniel Harabor, Mahdi Jalili:
Exact Multi-objective Path Finding with Negative Weights. 11-19 - Gregor Behnke, Marcel Steinmetz:
On the Computational Complexity of Stackelberg Planning and Meta-Operator Verification. 20-24 - Raven Beutner, Bernd Finkbeiner:
Non-deterministic Planning for Hyperproperty Verification. 25-30 - Blai Bonet, Dominik Drexler, Hector Geffner:
On Policy Reuse: An Expressive Language for Representing and Executing General Policies that Call Other Policies. 31-39 - Clemens Büchner, Patrick Ferber, Jendrik Seipp, Malte Helmert:
Abstraction Heuristics for Factored Tasks. 40-49 - J. Caballero Testón, María D. R.-Moreno:
Multi-Agent Temporal Task Solving and Plan Optimization. 50-58 - Matteo Cardellini, Marco Maratea, Francesco Percassi, Enrico Scala, Mauro Vallati:
Taming Discretised PDDL+ through Multiple Discretisations. 59-67 - Dillon Z. Chen, Felipe W. Trevizan, Sylvie Thiébaux:
Return to Tradition: Learning Reliable Heuristics with Classical Machine Learning. 68-76 - Xi Chen, Yue Zhang, Yonggang Zhang:
More Flexible Proximity Wildcards Path Planning with Compressed Path Databases. 77-85 - Lukás Chrpa, Erez Karpas:
On Verifying Linear Execution Strategies in Planning Against Nature. 86-94 - Andrew Coles, Erez Karpas, Andrey Lavrinenko, Wheeler Ruml, Solomon Eyal Shimony, Shahaf S. Shperberg:
Planning and Acting While the Clock Ticks. 95-103 - Augusto B. Corrêa, Giuseppe De Giacomo, Malte Helmert, Sasha Rubin:
Planning with Object Creation. 104-113 - Marek Cuchý, Jirí Vokrínek, Michal Jakob:
Multi-Objective Electric Vehicle Route and Charging Planning with Contraction Hierarchies. 114-122 - Magí Dalmau-Moreno, Néstor García, Vicenç Gómez, Hector Geffner:
Combined Task and Motion Planning via Sketch Decompositions. 123-132 - Emanuele De Pellegrin, Ronald P. A. Petrick:
Planning Domain Simulation: An Interactive System for Plan Visualisation. 133-141 - David DeFazio, Yohei Hayamizu, Shiqi Zhang:
Learning Quadruped Locomotion Policies Using Logical Rules. 142-150 - Simon Dold, Malte Helmert:
Higher-Dimensional Potential Heuristics: Lower Bound Criterion and Connection to Correlation Complexity. 151-161 - Jan Eisenhut, Xandra Schuler, Daniel Fiser, Daniel Höller, Maria Christakis, Jörg Hoffmann:
New Fuzzing Biases for Action Policy Testing. 162-167 - Anas El Kouaiti, Francesco Percassi, Alessandro Saetti, Thomas Leo McCluskey, Mauro Vallati:
PDDL+ Models for Deployable yet Effective Traffic Signal Optimisation. 168-177 - Mojtaba Elahi, Saurabh Fadnis, Jussi Rintanen:
Termination Properties of Transition Rules for Indirect Effects. 178-186 - Zhikang Fan, Weiran Shen:
A Fast Algorithm for k-Memory Messaging Scheme Design in Dynamic Environments with Uncertainty. 187-195 - Bowen Fang, Xu Chen, Zhengkun Pan, Xuan Di:
SLAMuZero: Plan and Learn to Map for Joint SLAM and Navigation. 196-200 - Ying Feng, Adittyo Paul, Zhe Chen, Jiaoyang Li:
A Real-Time Rescheduling Algorithm for Multi-robot Plan Execution. 201-209 - Daniel Fiser, Marcel Steinmetz:
Towards Feasible Higher-Dimensional Potential Heuristics. 210-220 - Orso Forghieri, Hind Castel, Emmanuel Hyon, Erwan Le Pennec:
Progressive State Space Disaggregation for Infinite Horizon Dynamic Programming. 221-229 - Michael Gimelfarb, Ayal Taitler, Scott Sanner:
JaxPlan and GurobiPlan: Optimization Baselines for Replanning in Discrete and Mixed Discrete-Continuous Probabilistic Domains. 230-238 - Claudia Grundke, Gabriele Röger, Malte Helmert:
Formal Representations of Classical Planning Domains. 239-248 - Akkamahadevi Hanni, Andrew Boateng, Yu Zhang:
Safe Explicable Planning. 249-257 - Issa K. Hanou, Devin Wild Thomas, Wheeler Ruml, Mathijs de Weerdt:
Replanning in Advance for Instant Delay Recovery in Multi-Agent Applications: Rerouting Trains in a Railway Hub. 258-266 - Hayyan Helal, Gerhard Lakemeyer:
An Analysis of the Decidability and Complexity of Numeric Additive Planning. 267-275 - Paul Höft, David Speck, Florian Pommerening, Jendrik Seipp:
Versatile Cost Partitioning with Exact Sensitivity Analysis. 276-280 - Rostislav Horcík, Gustav Sír:
Expressiveness of Graph Neural Networks in Planning Domains. 281-289 - Luke Hunsberger, Roberto Posenato:
Converting Simple Temporal Networks with Uncertainty into Minimal Equivalent Dispatchable Form. 290-300 - Zhaoxun Ju, Chao Yang, Fuchun Sun, Hongbo Wang, Yu Qiao:
Rethinking Mutual Information for Language Conditioned Skill Discovery on Imitation Learning. 301-309 - Rushang Karia, Pulkit Verma, Alberto Speranzon, Siddharth Srivastava:
Epistemic Exploration for Generalizable Planning and Learning in Non-Stationary Settings. 310-318 - Michael Katz, Junkyu Lee, Shirin Sohrabi:
Unifying and Certifying Top-Quality Planning. 319-323 - Benjamin Krarup, Amanda Jane Coles, Derek Long, David E. Smith:
Explaining Plan Quality Differences. 324-332 - David Kuric, Guillermo Infante, Vicenç Gómez, Anders Jonsson, Herke van Hoof:
Planning with a Learned Policy Basis to Optimally Solve Complex Tasks. 333-341 - Leonardo Lamanna, Luciano Serafini:
Action Model Learning from Noisy Traces: a Probabilistic Approach. 342-350 - Laurin Luttmann, Lin Xie:
Neural Combinatorial Optimization on Heterogeneous Graphs: An Application to the Picker Routing Problem in Mixed-shelves Warehouses. 351-359 - Tommaso Mannelli Mazzoli, Lucas Kletzander, Pascal Van Hentenryck, Nysret Musliu:
Investigating Large Neighbourhood Search for Bus Driver Scheduling. 360-368 - Jakub Med, Lukás Chrpa, Michael Morak, Wolfgang Faber:
Weak and Strong Reversibility of Non-deterministic Actions: Universality and Uniformity. 369-377 - Florian Mischek, Nysret Musliu:
Preference Explanation and Decision Support for Multi-Objective Real-World Test Laboratory Scheduling. 378-386 - Argaman Mordoch, Enrico Scala, Roni Stern, Brendan Juba:
Safe Learning of PDDL Domains with Conditional Effects. 387-395 - Déborah Conforto Nedelmann, Jérôme Lacan, Caroline P. C. Chanel:
SKATE : Successive Rank-based Task Assignment for Proactive Online Planning. 396-404 - Stefan Neubert, Katrin Casel:
Incremental Ordering for Scheduling Problems. 405-413 - Khoi P. N. Nguyen, Raghuram Ramanujan:
Lookahead Pathology in Monte-Carlo Tree Search. 414-422 - James T. Oswald, Kavitha Srinivas, Harsha Kokel, Junkyu Lee, Michael Katz, Shirin Sohrabi:
Large Language Models as Planning Domain Generators. 423-431 - Vishal Pallagani, Bharath C. Muppasani, Kaushik Roy, Francesco Fabiano, Andrea Loreggia, Keerthiram Murugesan, Biplav Srivastava, Francesca Rossi, Lior Horesh, Amit P. Sheth:
On the Prospects of Incorporating Large Language Models (LLMs) in Automated Planning and Scheduling (APS). 432-444 - Florian Pommerening, Clemens Büchner, Thomas Keller:
Transition Landmarks from Abstraction Cuts. 445-454 - Alberto Pozanco, Álvaro Torralba, Daniel Borrajo:
Computing Planning Centroids and Minimum Covering States Using Symbolic Bidirectional Search. 455-463 - Abhinav Rajvanshi, Karan Sikka, Xiao Lin, Bhoram Lee, Han-Pang Chiu, Alvaro Velasquez:
SayNav: Grounding Large Language Models for Dynamic Planning to Navigation in New Environments. 464-474 - Robbert Reijnen, Yingqian Zhang, Hoong Chuin Lau, Zaharah Allah Bukhsh:
Online Control of Adaptive Large Neighborhood Search Using Deep Reinforcement Learning. 475-483 - Jingyao Ren, Eric Ewing, T. K. Satish Kumar, Sven Koenig, Nora Ayanian:
Map Connectivity and Empirical Hardness of Grid-based Multi-Agent Pathfinding Problem. 484-488 - Rogelio E. Cardona-Rivera, Arnav Jhala, Julie Porteous, R. Michael Young:
The Story So Far on Narrative Planning. 489-499 - Nicholas Rossetti, Massimiliano Tummolo, Alfonso Emilio Gerevini, Luca Putelli, Ivan Serina, Mattia Chiari, Matteo Olivato:
Learning General Policies for Planning through GPT Models. 500-508 - Jendrik Seipp:
Efficiently Computing Transitions in Cartesian Abstractions. 509-513 - Qian Shao, Pradeep Varakantham, Shih-Fen Cheng:
Imitating Cost-Constrained Behaviors in Reinforcement Learning. 514-522 - Yorai Shaoul, Itamar Mishani, Maxim Likhachev, Jiaoyang Li:
Accelerating Search-Based Planning for Multi-Robot Manipulation by Leveraging Online-Generated Experiences. 523-531 - Yash Shukla, Tanushree Burman, Abhishek Kulkarni, Robert Wright, Alvaro Velasquez, Jivko Sinapov:
Logical Specifications-guided Dynamic Task Sampling for Reinforcement Learning Agents. 532-540 - Silvan Sievers, Thomas Keller, Gabriele Röger:
Merging or Computing Saturated Cost Partitionings? A Merge Strategy for the Merge-and-Shrink Framework. 541-545 - David Speck, Daniel Gnad:
Decoupled Search for the Masses: A Novel Task Transformation for Classical Planning. 546-554 - Marcel Steinmetz, Sylvie Thiébaux, Daniel Höller, Florent Teichteil-Königsbuch:
Explaining the Space of SSP Policies via Policy-Property Dependencies: Complexity, Algorithms, and Relation to Multi-Objective Planning. 555-564 - Paula Stocco, Suhas Chundi, Arec L. Jamgochian, Mykel J. Kochenderfer:
Addressing Myopic Constrained POMDP Planning with Recursive Dual Ascent. 565-569 - Wen Jun Tan, Xueyan Tang, Wentong Cai:
Robust Multi-Agent Pathfinding with Continuous Time. 570-578 - Jingtao Tang, Hang Ma:
Multi-Robot Connected Fermat Spiral Coverage. 579-587 - Rasmus G. Tollund, Nicklas S. Johansen, Kristian Ø. Nielsen, Álvaro Torralba, Kim G. Larsen:
Optimal Infinite Temporal Planning: Cyclic Plans for Priced Timed Automata. 588-596 - Rishi Veerapaneni, Qian Wang, Kevin Ren, Arthur Jakobsson, Jiaoyang Li, Maxim Likhachev:
Improving Learnt Local MAPF Policies with Heuristic Search. 597-606 - Marcel Vinzent, Jörg Hoffmann:
Neural Action Policy Safety Verification: Applicablity Filtering. 607-612 - Fangji Wang, Han Zhang, Sven Koenig, Jiaoyang Li:
Efficient Approximate Search for Multi-Objective Multi-Agent Path Finding. 613-622 - Qian Wang, Rishi Veerapaneni, Yu Wu, Jiaoyang Li, Maxim Likhachev:
MAPF in 3D Warehouses: Dataset and Analysis. 623-632 - Ryan Xiao Wang, Sylvie Thiébaux:
Learning Generalised Policies for Numeric Planning. 633-642 - Eyal Weiss, Ariel Felner, Gal A. Kaminka:
Tightest Admissible Shortest Path. 643-652 - Kai Xi, Stephen Gould, Sylvie Thiébaux:
Neuro-Symbolic Learning of Lifted Action Models from Visual Traces. 653-662 - Zhiyuan Yao, Ionut Florescu, Chihoon Lee:
Control in Stochastic Environment with Delays: A Model-based Reinforcement Learning Approach. 663-670 - Parisa Zehtabi, Alberto Pozanco, Ayala Bolch, Daniel Borrajo, Sarit Kraus:
Contrastive Explanations of Centralized Multi-agent Optimization Solutions. 671-679 - Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths. 680-688 - Xiaodi Zhang, Alban Grastien, Charles Gretton:
A Counter-Example Based Approach to Probabilistic Conformant Planning. 689-697 - Yuan Zhang, Umashankar Deekshith, Jianhong Wang, Joschka Boedecker:
Improving the Efficiency and Efficacy of Multi-Agent Reinforcement Learning on Complex Railway Networks with a Local-Critic Approach. 698-706 - Yue Zhang, Zhe Chen, Daniel Harabor, Pierre Le Bodic, Peter J. Stuckey:
Planning and Execution in Multi-Agent Path Finding: Models and Algorithms. 707-715 - Itai Zilberstein, Ananya Rao, Matthew Salis, Steve A. Chien:
Decentralized, Decomposition-Based Observation Scheduling for a Large-Scale Satellite Constellation. 716-724
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 2026-01-27 00:42 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:
