Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID32nd ICAPS 2022: Singapore [virtual]
- Akshat Kumar, Sylvie Thiébaux, Pradeep Varakantham, William Yeoh:
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, ICAPS 2022, Singapore (virtual), June 13-24, 2022. AAAI Press 2022, ISBN 978-1-57735-874-9 - Sylvie Thiébaux, William Yeoh, Akshat Kumar, Pradeep Varakantham:
Preface.
Main Track
- Aakash, Indranil Saha:
It Costs to Get Costs! A Heuristic-Based Scalable Goal Assignment Algorithm for Multi-Robot Systems. 2-10 - Augusto B. Corrêa, Jendrik Seipp:
Best-First Width Search for Lifted Classical Planning. 11-15 - Martim Brandao, Amanda Jane Coles, Andrew Coles, Jörg Hoffmann:
Merge and Shrink Abstractions for Temporal Planning. 16-25 - Dillon Ze Chen
, Pascal Bercher:
Flexible FOND HTN Planning: A Complexity Analysis. 26-34 - Lihan Chen, Jingping Liu, Sihang Jiang, Chao Wang, Jiaqing Liang, Yanghua Xiao, Sheng Zhang, Rui Song:
Crossword Puzzle Resolution via Monte Carlo Tree Search. 35-43 - Remo Christen, Salomé Eriksson, Florian Pommerening, Malte Helmert:
Detecting Unsolvability Based on Separating Functions. 44-52 - Franck Djeumou, Murat Cubuktepe, Craig Lennon, Ufuk Topcu:
Task-Guided Inverse Reinforcement Learning under Partial Information. 53-61 - Dominik Drexler, Jendrik Seipp, Hector Geffner:
Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width. 62-70 - Masood Feyzbakhsh Rankooh, Jussi Rintanen:
Efficient Computation and Informative Estimation of h+ by Integer and Linear Programming. 71-79 - Daniel Fiser, Álvaro Torralba, Jörg Hoffmann:
Operator-Potentials in Symbolic Search: From Forward to Bi-directional Search. 80-89 - Ramon Fraga Pereira, André Grahl Pereira, Frederico Messa, Giuseppe De Giacomo:
Iterative Depth-First Search for FOND Planning. 90-99 - Florian Geißer, Patrik Haslum, Sylvie Thiébaux, Felipe W. Trevizan:
Admissible Heuristics for Multi-Objective Planning. 100-109 - Daniel Gnad, Álvaro Torralba, Daniel Fiser:
Beyond Stars - Generalized Topologies for Decoupled Search. 110-118 - Sriram Gopalakrishnan, Daniel Borrajo:
Assignment and Prioritization of Tasks with Uncertain Durations for Satisfying Makespans in Decentralized Execution. 119-123 - Malte Helmert, Silvan Sievers, Alexander Rovner, Augusto B. Corrêa:
On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond. 124-133 - Daniel Höller, Gregor Behnke:
Encoding Lifted Classical Planning in Propositional Logic. 134-144 - Daniel Höller, Julia Wichlacz, Pascal Bercher, Gregor Behnke:
Compiling HTN Plan Verification Problems into HTN Planning Problems. 145-150 - Valentin Honoré, Bertrand Simon, Frédéric Suter:
An Exact Algorithm for the Linear Tape Scheduling Problem. 151-159 - Rostislav Horcík, Álvaro Torralba, Pavel Rytír, Lukás Chrpa, Stefan Edelkamp:
Optimal Mixed Strategies for Cost-Adversarial Planning Games. 160-168 - Shuli Hu, Daniel Damir Harabor, Graeme Gange, Peter J. Stuckey, Nathan R. Sturtevant:
Multi-Agent Path Finding with Temporal Jump Point Search. 169-173 - Erez Karpas:
A Compilation Based Approach to Finding Centroids and Minimum Covering States in Planning. 174-178 - Michael Katz, Shirin Sohrabi:
Who Needs These Operators Anyway: Top Quality Planning with Operator Subset Criteria. 179-183 - Thorsten Klößner, Marcel Steinmetz, Álvaro Torralba, Jörg Hoffmann:
Pattern Selection Strategies for Pattern Databases in Probabilistic Planning. 184-192 - Thorsten Klößner, Florian Pommerening, Thomas Keller, Gabriele Röger:
Cost Partitioning Heuristics for Stochastic Shortest Path Problems. 193-202 - Ryo Kuroiwa, Alexander Shleyfman, J. Christopher Beck:
LM-Cut Heuristics for Optimal Linear Numeric Planning. 203-212 - Ryo Kuroiwa, J. Christopher Beck:
Biased Exploration for Satisficing Heuristic Search. 213-221 - Sofia Lemons, Carlos Linares López, Robert C. Holte, Wheeler Ruml:
Beam Search: Faster and Monotonic. 222-230 - Songtuan Lin, Pascal Bercher:
On the Expressive Power of Planning Formalisms in Conjunction with LTL. 231-240 - Xiaoyou Lin, Qingliang Chen, Liangda Fang, Quanlong Guan, Weiqi Luo, Kaile Su:
Generalized Linear Integer Numeric Planning. 241-251 - Jakub Med, Lukás Chrpa:
On Speeding Up Methods for Identifying Redundant Actions in Plans. 252-260 - Malia Morgan, Julianna Schalkwyk, Huaxiaoyue Wang, Hannah Davalos, Ryan Martinez, Vibha Rohilla, James Boerkoel:
Simple Temporal Networks for Improvisational Teamwork. 261-269 - Keisuke Okumura, Xavier Défago:
Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution. 270-278 - Joaquim Ortiz de Haro, Erez Karpas, Marc Toussaint, Michael Katz:
Conflict-Directed Diverse Planning for Logic-Geometric Programming. 279-287 - Francesco Percassi, Enrico Scala, Mauro Vallati:
The Power of Reformulation: From Validation to Planning in PDDL+. 288-296 - Quang Anh Pham, Minh Hoàng Hà, Duy Manh Vu, Huy Hoang Nguyen:
A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Roaming Delivery Locations. 297-306 - Marc Rigter, Paul Duckworth, Bruno Lacerda, Nick Hawes:
Planning for Risk-Aversion and Expected Value in MDPs. 307-315 - Alessandro Saetti, Enrico Scala:
Optimising the Stability in Plan Repair via Compilation. 316-320 - Guru Koushik Senthil Kumar, Sandip Aine, Maxim Likhachev:
Euclidean Distance-Optimal Post-processing of Grid-Based Paths. 321-328 - Irfansha Shaik, Jaco van de Pol:
Classical Planning as QBF without Grounding. 329-337 - Bojie Shen, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Improving Time-Dependent Contraction Hierarchies. 338-347 - David Speck, Jendrik Seipp:
New Refinement Strategies for Cartesian Abstractions. 348-352 - Marcel Steinmetz, Daniel Fiser, Hasan Ferit Eniser, Patrick Ferber, Timo P. Gros, Philippe Heim, Daniel Höller, Xandra Schuler, Valentin Wüstholz, Maria Christakis, Jörg Hoffmann:
Debugging a Policy: Automatic Action-Policy Testing in AI Planning. 353-361 - Matan Sudry, Erez Karpas:
Learning to Estimate Search Progress Using Sequence of States. 362-370 - Marcel Vinzent, Marcel Steinmetz, Jörg Hoffmann:
Neural Network Action Policy Verification via Predicate Abstraction. 371-379 - Julian von Tschammer, Robert Mattmüller, David Speck:
Loopless Top-K Planning. 380-384 - Rui Wang, Kai Gao, Jingjin Yu, Kostas E. Bekris:
Lazy Rearrangement Planning in Confined Spaces. 385-393 - Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
A*pex: Efficient Approximate Multi-Objective Search on Graphs. 394-403 - Jiachen Zhang, Giovanni Lo Bianco, J. Christopher Beck:
Solving Job-Shop Scheduling Problems with QUBO-Based Specialized Hardware. 404-412 - Tianming Zhao, Wei Li, Albert Y. Zomaya:
Uniform Machine Scheduling with Predictions. 413-422 - Yi Zheng, Srivatsan Ravi, Erik Kline, Sven Koenig, T. K. Satish Kumar:
Conflict-Based Search for the Virtual Network Embedding Problem. 423-433
Industry and Applications Track
- Martijn Beeks, Reza Refaei Afshar, Yingqian Zhang, Remco M. Dijkman, Claudy van Dorst, Stijn de Looijer:
Deep Reinforcement Learning for a Multi-Objective Online Order Batching Problem. 435-443 - Jonathan Chase, Siong Thye Goh, Tran Phong, Hoong Chuin Lau:
OFFICERS: Operational Framework for Intelligent Crime-and-Emergency Response Scheduling. 444-452 - Waldy Joe, Hoong Chuin Lau, Jonathan Pan:
Reinforcement Learning Approach to Solve Dynamic Bi-objective Police Patrol Dispatching and Rescheduling Problem. 453-461 - Lucas Kletzander, Nysret Musliu:
Hyper-Heuristics for Personnel Scheduling Domains. 462-470 - Richard Levinson, Samantha Niemoeller, Sreeja Nag, Vinay Ravindra:
Planning Satellite Swarm Measurements for Earth Science Models: Comparing Constraint Processing and MILP Methods. 471-479 - Geert L. J. Pingen, Christian R. van Ommeren, Cornelis J. van Leeuwen, Ruben W. Fransen, Tijmen Elfrink, Yorick C. de Vries, Janarthanan Karunakaran, Emir Demirovic, Neil Yorke-Smith:
Talking Trucks: Decentralized Collaborative Multi-Agent Order Scheduling for Self-Organizing Logistics. 480-489 - Cédric Pralet, David Doose, Julien Anxionnat, Jérémie Pouly:
Building Resource-Dependent Conditional Plans for an Earth Monitoring Satellite. 490-498 - Sanket Shah, Meghna Lowalekar, Pradeep Varakantham:
Joint Pricing and Matching for City-Scale Ride-Pooling. 499-507 - Karthik Valmeekam, Sarath Sreedharan, Sailik Sengupta, Subbarao Kambhampati:
RADAR-X: An Interactive Mixed Initiative Planning Interface Pairing Contrastive Explanations and Revised Plan Suggestions. 508-517 - Daniel Wang, Joseph A. Russino, Connor Basich, Steve A. Chien:
Analyzing the Efficacy of Flexible Execution, Replanning, and Plan Optimization for a Planetary Lander. 518-526 - Zheyuan Wang, Matthew C. Gombolay:
Stochastic Resource Optimization over Heterogeneous Graph Neural Networks for Failure-Predictive Maintenance Scheduling. 527-536 - Yang Zhou, Fang Wang, Zhan Shi, Dan Feng:
An End-to-End Automatic Cache Replacement Policy Using Deep Reinforcement Learning. 537-545
Planning and Learning Track
- Benjamin J. Ayton, Masataro Asai:
Is Policy Learning Overrated?: Width-Based Planning and Active Learning for Atari. 547-555 - Abhinav Bhatia, Justin Svegliato, Samer B. Nashed, Shlomo Zilberstein:
Tuning the Hyperparameters of Anytime Planning: A Metareasoning Approach with Deep Reinforcement Learning. 556-564 - Simon Bøgh, Peter Gjøl Jensen, Martin Kristjansen, Kim Guldstrand Larsen, Ulrik Nyman:
Distributed Fleet Management in Noisy Environments via Model-Predictive Control. 565-573 - Taylor Dohmen, Noah Topper, George K. Atia, Andre Beckus, Ashutosh Trivedi, Alvaro Velasquez:
Inferring Probabilistic Reward Machines from Non-Markovian Reward Signals for Reinforcement Learning. 574-582 - Patrick Ferber, Florian Geißer, Felipe W. Trevizan, Malte Helmert, Jörg Hoffmann:
Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other Methods. 583-587 - Clement Gehring, Masataro Asai, Rohan Chitnis, Tom Silver, Leslie Pack Kaelbling, Shirin Sohrabi, Michael Katz:
Reinforcement Learning for Classical Planning: Viewing Heuristics as Dense Reward Generators. 588-596 - Maxence Grand, Damien Pellier, Humbert Fiorino:
TempAMLSI: Temporal Action Model Learning Based on STRIPS Translation. 597-605 - Kin-Ho Lam, Delyar Tabatabai, Jed Irvine, Donald Bertucci, Anita Ruangrotsakun, Minsuk Kahng, Alan Fern:
Beyond Value: CheckList for Testing Inferences in Planning-Based RL. 606-614 - Cyrus Neary, Christos K. Verginis, Murat Cubuktepe, Ufuk Topcu:
Verifiable and Compositional Reinforcement Learning Systems. 615-623 - Jingqing Ruan, Linghui Meng, Xuantang Xiong, Dengpeng Xing, Bo Xu:
Learning Multi-Agent Action Coordination via Electing First-Move Agent. 624-628 - Simon Ståhlberg, Blai Bonet, Hector Geffner:
Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits. 629-637 - Pierre Tassel, Benjamin Kovács, Martin Gebser, Konstantin Schekotihin, Wolfgang Kohlenbrein, Philipp Schrott-Kostwein:
Reinforcement Learning of Dispatching Strategies for Large-Scale Industrial Scheduling. 638-646 - Noah Topper, George K. Atia, Ashutosh Trivedi, Alvaro Velasquez:
Active Grammatical Inference for Non-Markovian Planning. 647-651 - Alvaro Velasquez, Brett Bissey, Lior Barak, Daniel Melcer, Andre Beckus, Ismail Alkhouri, George K. Atia:
Multi-Agent Tree Search with Dynamic Reward Shaping. 652-661 - Jin Yu, Haiyin Piao, Yaqing Hou, Li Mo, Xin Yang, Deyun Zhou:
DOMA: Deep Smooth Trajectory Generation Learning for Real-Time UAV Motion Planning. 662-666
Human-Aware Planning and Scheduling Track
- Sara Bernardini, Fabio Fagnani, Santiago Franco, Alexandra Neacsu:
A Network Flow Interpretation of Robust Goal Legibility in Path Finding. 668-677 - Gabriel Dias Cantareira, Gerard Canal, Rita Borgo:
Actor-Focused Interactive Visualization for AI Planning. 678-686 - Rebecca Eifler, Martim Brandao, Amanda Jane Coles, Jeremy Frank, Jörg Hoffmann:
Evaluating Plan-Property Dependencies: A Web-Based Platform and User Study. 687-691 - Justin Kottinger, Shaull Almagor, Morteza Lahijanian:
Conflict-Based Search for Explainable Multi-Agent Path Finding. 692-700 - Ashwin Kumar, Stylianos Loukas Vasileiou, Melanie Bancilhon, Alvitta Ottley, William Yeoh:
VizXP: A Visualization Framework for Conveying Explanations to Users in Model Reconciliation Problems. 701-709 - Alberto Pozanco, Francesca Mosca, Parisa Zehtabi, Daniele Magazzeni, Sarit Kraus:
Explaining Preference-Driven Schedules: The EXPRES Framework. 710-718 - Maayan Shvo, Toryn Q. Klassen, Sheila A. McIlraith:
Resolving Misconceptions about the Plans of Agents via Theory of Mind. 719-729 - Loïs Vanhée, Laurent Jeanpierre, Abdel-Illah Mouaddib:
Anxiety-Sensitive Planning: From Formal Foundations to Algorithms and Applications. 730-740
a service of 
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 2024-04-22 21:14 CEST 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:
