default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID33rd ICAPS 2023: Prague, Czech Republic
- Sven Koenig, Roni Stern, Mauro Vallati:
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, Prague, Czech Republic, July 8-13, 2023. AAAI Press 2023 - Frontmatter.
Main Track
- Diego Aineto, Enrico Scala
, Eva Onaindia, Ivan Serina:
Falsification of Cyber-Physical Systems Using PDDL+ Planning. 2-6 - Abeer Alshehri, Tim Miller, Mor Vered:
Explainable Goal Recognition: A Framework Based on Weight of Evidence. 7-16 - Dor Atzmon, Sara Bernardini, Fabio Fagnani, David L. Fairbairn:
Exploiting Geometric Constraints in Multi-Agent Pathfinding. 17-25 - Dor Atzmon, Shahaf S. Shperberg, Netanel Sabah, Ariel Felner, Nathan R. Sturtevant:
W-restrained Bidirectional Bounded-Suboptimal Heuristic Search. 26-30 - Mohammad Bakhshalipour, Mohamad Qadri, Dominic Guri, Seyed Borna Ehsani, Maxim Likhachev, Phillip B. Gibbons:
Runahead A*: Speculative Parallelism for A* with Slow Expansions. 31-41 - Gregor Behnke, David Speck, Michael Katz, Shirin Sohrabi:
On Partial Satisfaction Planning with Total-Order HTNs. 42-51 - Johannes Blum, Ruoying Li, Sabine Storandt:
Convexity Hierarchies in Grid Networks. 52-60 - Luigi Bonassi, Giuseppe De Giacomo, Marco Favorito, Francesco Fuggitti, Alfonso Emilio Gerevini, Enrico Scala:
Planning for Temporally Extended Goals in Pure-Past Linear Temporal Logic. 61-69 - Clemens Büchner, Thomas Keller, Salomé Eriksson, Malte Helmert:
Landmark Progression in Heuristic Search. 70-79 - Filip Cano Córdoba, Alexander Palmisano, Martin Fränzle, Roderick Bloem, Bettina Könighofer:
Safety Shielding under Delayed Observation. 80-85 - Brittany Cates, Anagha Kulkarni, Sarath Sreedharan:
Planning for Attacker Entrapment in Adversarial Settings. 86-94 - Rosy Chen, Yiran Ma, Siqi Wu, James C. Boerkoel Jr.:
Sensitivity Analysis for Dynamic Control of PSTNs with Skewed Distributions. 95-99 - Augusto B. Corrêa, Markus Hecher, Malte Helmert, Davide Mario Longo, Florian Pommerening, Stefan Woltran:
Grounding Planning Tasks Using Tree Decompositions and Iterated Solving. 100-108 - Jan Eisenhut, Álvaro Torralba, Maria Christakis, Jörg Hoffmann:
Automatic Metamorphic Test Oracles for Action-Policy Testing. 109-117 - Daniel Fiser:
Operator Pruning Using Lifted Mutex Groups via Compilation on Lifted Level. 118-127 - Cheng Ge, Han Zhang, Jiaoyang Li, Sven Koenig:
Cost Splitting for Multi-Objective Conflict-Based Search. 128-137 - Daniel Gnad, Silvan Sievers, Álvaro Torralba:
Efficient Evaluation of Large Abstractions for Decoupled Search: Merge-and-Shrink and Symbolic Pattern Databases. 138-147 - Daniel Gnad, Malte Helmert, Peter Jonsson, Alexander Shleyfman:
Planning over Integers: Compilations and Undecidability. 148-152 - Alba Gragera, Raquel Fuentetaja, Ángel García Olaya, Fernando Fernández:
A Planning Approach to Repair Domains with Incomplete Action Effects. 153-161 - Dennis Gross, Christoph Schmidl, Nils Jansen, Guillermo A. Pérez:
Model Checking for Adversarial Multi-Agent Reinforcement Learning with Reactive Defense Methods. 162-170 - Matthias Horn, Emir Demirovic, Neil Yorke-Smith:
Parallel Batch Processing for the Coating Problem. 171-179 - Guang Hu, Tim Miller, Nir Lipovetzky:
Planning with Multi-Agent Belief Using Justified Perspectives. 180-188 - Taoan Huang, Vikas Shivashankar, Michael Caldara, Joseph W. Durham, Jiaoyang Li, Bistra Dilkina, Sven Koenig:
Deadline-Aware Multi-Agent Tour Planning. 189-197 - Arec L. Jamgochian, Anthony Corso, Mykel J. Kochenderfer:
Online Planning for Constrained POMDPs with Continuous Spaces through Dual Ascent. 198-202 - Thorsten Klößner, Álvaro Torralba, Marcel Steinmetz, Silvan Sievers:
A Theory of Merge-and-Shrink for Stochastic Shortest Path Problems. 203-211 - Merlijn Krale, Thiago D. Simão, Nils Jansen:
Act-Then-Measure: Reinforcement Learning for Partially Observable Environments with Active Measuring. 212-220 - Raphael Kreft, Clemens Büchner, Silvan Sievers, Malte Helmert:
Computing Domain Abstractions for Optimal Classical Planning with Counterexample-Guided Abstraction Refinement. 221-226 - Ashwin Kumar, Yevgeniy Vorobeychik, William Yeoh:
Using Simple Incentives to Improve Two-Sided Fairness in Ridesharing Systems. 227-235 - Ryo Kuroiwa, J. Christopher Beck:
Domain-Independent Dynamic Programming: Generic State Space Search for Combinatorial Optimization. 236-244 - Ryo Kuroiwa, J. Christopher Beck:
Solving Domain-Independent Dynamic Programming Problems with Anytime Heuristic Search. 245-253 - Edward Lam, Daniel Damir Harabor, Peter J. Stuckey, Jiaoyang Li:
Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood Search. 254-258 - Alan Lindsay:
On Using Action Inheritance and Modularity in PDDL Domain Modelling. 259-267 - Raúl Mencía, Carlos Mencía, João Marques-Silva:
Efficient Reasoning about Infeasible One Machine Sequencing. 268-276 - Frederico Messa, André Grahl Pereira:
A Best-First Search Algorithm for FOND Planning and Heuristic Functions to Optimize Decompressed Solution Size. 277-285 - Esther Mugdan, Remo Christen, Salomé Eriksson:
Optimality Certificates for Classical Planning. 286-294 - Andrew Murray, Ashwin Arulselvan, Michael Cashmore, Marc Roper, Jeremy Frank:
A Column Generation Approach to Correlated Simple Temporal Networks. 295-303 - Bernhard Nebel:
The Small Solution Hypothesis for MAPF on Strongly Connected Directed Graphs Is True. 304-313 - Conny Olz, Pascal Bercher:
Can They Come Together? A Computational Complexity Analysis of Conjunctive Possible Effects of Compound HTN Planning Tasks. 314-323 - Francesco Percassi, Enrico Scala, Mauro Vallati:
Fixing Plans for PDDL+ Problems: Theoretical and Practical Implications. 324-333 - Loc Pham, Tran Cao Son, Enrico Pontelli:
Planning in Multi-Agent Domains with Untruthful Announcements. 334-342 - Quang Anh Pham, Hoong Chuin Lau, Minh Hoàng Hà, Lam Vu:
An Efficient Hybrid Genetic Algorithm for the Quadratic Traveling Salesman Problem. 343-351 - Sergey Polyakovskiy, Peter J. Stuckey:
A Constraint Programming Solution to the Guillotine Rectangular Cutting Problem. 352-360 - Zhongqiang Ren, Jiaoyang Li, Han Zhang, Sven Koenig, Sivakumar Rathinam, Howie Choset:
Binary Branching Multi-Objective Conflict-Based Search for Multi-Agent Path Finding. 361-369 - Philipp Sauer, Marcel Steinmetz, Robert Künnemann, Jörg Hoffmann:
Lifted Stackelberg Planning. 370-374 - Buser Say:
Robust Metric Hybrid Planning in Stochastic Nonlinear Domains Using Mathematical Optimization. 375-383 - Bojie Shen, Zhe Chen, Jiaoyang Li, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Beyond Pairwise Reasoning in Multi-Agent Path Finding. 384-392 - Alexander Shleyfman, Ryo Kuroiwa, J. Christopher Beck:
Symmetry Detection and Breaking in Linear Cost-Optimal Numeric Planning. 393-401 - Bar Shofer, Guy Shani, Roni Stern:
Multi Agent Path Finding under Obstacle Uncertainty. 402-410 - David Speck, Paul Höft, Daniel Gnad, Jendrik Seipp:
Finding Matrix Multiplication Algorithms with Classical Planning. 411-416 - Sarath Sreedharan, Christian Muise, Subbarao Kambhampati:
Generalizing Action Justification and Causal Links to Policies. 417-426 - Eyal Weiss, Gal A. Kaminka:
Planning with Multiple Action-Cost Estimates. 427-437 - Lebin Yu, Yunbo Qiu, Quanming Yao, Xudong Zhang, Jian Wang:
Improving Zero-Shot Coordination Performance Based on Policy Similarity. 438-442 - Chenyuan Zhang, Charles Kemp, Nir Lipovetzky:
Goal Recognition with Timing Information. 443-451 - Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa, Sven Koenig:
Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies. 452-461 - Yuening Zhang, Brian C. Williams:
Adaptation and Communication in Human-Robot Teaming to Handle Discrepancies in Agents' Beliefs about Plans. 462-471 - Yi Zheng, Hang Ma, Sven Koenig, Erik Kline, T. K. Satish Kumar:
Priority-Based Search for the Virtual Network Embedding Problem. 472-480
Industry and Applications Track
- Issa K. Hanou, Mathijs Michiel de Weerdt, Jesse Mulderij:
Moving Trains like Pebbles: A Feasibility Study on Tree Yards. 482-490 - Matthias Horn, Emir Demirovic, Neil Yorke-Smith:
Solving the Multi-Choice Two Dimensional Shelf Strip Packing Problem with Time Windows. 491-499 - Saad Khan, Simon Parkinson, Monika Roopak, Rachel Armitage, Andrew Barlow:
Automated Planning to Prioritise Digital Forensics Investigation Cases Containing Indecent Images of Children. 500-508 - Lucas Kletzander, Nysret Musliu:
Dynamic Weight Setting for Personnel Scheduling with Many Objectives. 509-517 - Wiktor Piotrowski, Yoni Sher, Sachin Grover, Roni Stern, Shiwali Mohan:
Heuristic Search for Physics-Based Problems: Angry Birds in PDDL+. 518-526 - Alberto Pozanco, Kassiani Papasotiriou, Daniel Borrajo, Manuela Veloso:
Combining Heuristic Search and Linear Programming to Compute Realistic Financial Plans. 527-531 - Alessandro Umbrico, Marco Benadduci, Roberta Bevilacqua, Amedeo Cesta, Francesca Fracasso, Elvira Maranesi, Andrea Orlandini, Gabriella Cortellessa:
Combining Clinical and Spatial Constraints into Temporal Planning to Personalize Physical Rehabilitation. 532-540
Planning and Learning Track
- Vaibhav Bajaj, Guni Sharon, Peter Stone:
Task Phasing: Automated Curriculum Learning from Demonstrations. 542-550 - Viet The Bui, Tien Anh Mai:
Imitation Improvement Learning for Large-Scale Capacitated Vehicle Routing Problems. 551-559 - Mattia Chiari, Alfonso Emilio Gerevini, Francesco Percassi, Luca Putelli, Ivan Serina, Matteo Olivato:
Goal Recognition as a Deep Learning Task: The GRNet Approach. 560-568 - Tomás Delgado, Marco Sánchez Sorondo, Víctor A. Braberman, Sebastián Uchitel:
Exploration Policies for On-the-Fly Controller Synthesis: A Reinforcement Learning Approach. 569-577 - Amin Falah, Shibashis Guha, Ashutosh Trivedi:
Reinforcement Learning for Omega-Regular Specifications on Continuous-Time MDP. 578-586 - Alan Lewis, Tim Miller:
Deceptive Reinforcement Learning in Model-Free Domains. 587-595 - Siow Meng Low, Akshat Kumar, Scott Sanner:
Safe MDP Planning by Learning Temporal Patterns of Undesirable Trajectories and Averting Negative Side Effects. 596-604 - Yash Shukla, Abhishek Kulkarni, Robert Wright, Alvaro Velasquez, Jivko Sinapov:
Automaton-Guided Curriculum Generation for Reinforcement Learning Agents. 605-613 - Pierre Tassel, Martin Gebser, Konstantin Schekotihin:
An End-to-End Reinforcement Learning Approach for Job-Shop Scheduling Problems Based on Constraint Programming. 614-622 - Florent Teichteil-Königsbuch, Guillaume Povéda, Guillermo González de Garibay Barba, Tim Luchterhand, Sylvie Thiébaux:
Fast and Robust Resource-Constrained Scheduling with Graph Neural Networks. 623-633 - Rishi Veerapaneni, Muhammad Suhail Saleem, Maxim Likhachev:
Learning Local Heuristics for Search-Based Navigation Planning. 634-638 - Kandai Watanabe, Georgios Fainekos, Bardh Hoxha, Morteza Lahijanian, Danil V. Prokhorov, Sriram Sankaranarayanan, Tomoya Yamaguchi:
Timed Partial Order Inference Algorithm. 639-647
Robotics Track
- Uwe Köckemann, Daniele Calisi, Guglielmo Gemignani, Jennifer Renoux, Alessandro Saffiotti:
Planning for Automated Testing of Implicit Constraints in Behavior Trees. 649-658 - Avichai Levy, Erez Karpas:
Understanding Natural Language in Context. 659-667 - Dhruv Saxena, Maxim Likhachev:
Planning for Manipulation among Movable Objects: Deciding Which Objects Go Where, in What Order, and How. 668-676 - Martina Stadler, Jacopo Banfi, Nicholas Roy:
Approximating the Value of Collaborative Team Actions for Efficient Multiagent Navigation in Uncertain Graphs. 677-685
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 22:06 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:
