Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st ICAPS 2021: Guangzhou, China
- Susanne Biundo, Minh Do, Robert Goldman, Michael Katz, Qiang Yang, Hankz Hankui Zhuo:
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, ICAPS 2021, Guangzhou, China (virtual), August 2-13, 2021. AAAI Press 2021, ISBN 978-1-57735-867-1
Main Track
- Mridul Agarwal, Vaneet Aggarwal:
Blind Decision Making: Reinforcement Learning with Delayed Observations. 2-6 - Vidal Alcázar:
The Consistent Case in Bidirectional Search and a Bucket-to-Bucket Algorithm as a Middle Ground between Front-to-End and Front-to-Front. 7-15 - Dor Atzmon, Shahar Idan Freiman, Oscar Epshtein, Oran Shichman, Ariel Felner:
Conflict-Free Multi-Agent Meeting. 16-24 - Gregor Behnke:
Block Compression and Invariant Pruning for SAT-based Totally-Ordered HTN Planning. 25-35 - Pascal Bercher:
A Closer Look at Causal Links: Complexity Results for Delete-Relaxation in Partial Order Causal Link (POCL) Planning. 36-45 - Luigi Bonassi, Alfonso Emilio Gerevini, Francesco Percassi, Enrico Scala:
On Planning with Qualitative State-Trajectory Constraints in PDDL3 by Compiling them Away. 46-50 - Daniel Borrajo, Manuela Veloso:
Computing Opportunities to Augment Plans for Novel Replanning during Execution. 51-55 - Martim Brandão, Amanda Jane Coles, Daniele Magazzeni:
Explaining Path Plan Optimality: Fast Explanation Methods for Navigation Meshes Using Full and Incremental Inverse Optimization. 56-64 - Clemens Büchner, Thomas Keller, Malte Helmert:
Exploiting Cyclic Dependencies in Landmark Heuristics. 65-73 - Dillon Ze Chen
, Pascal Bercher:
Fully Observable Nondeterministic HTN Planning - Formalisation and Complexity Results. 74-84 - Kenny Chour, Sivakumar Rathinam, Ramamoorthi Ravi:
S*: A Heuristic Information-Based Approximation Framework for Multi-Goal Path Finding. 85-93 - Augusto B. Corrêa, Guillem Francès, Florian Pommerening, Malte Helmert:
Delete-Relaxation Heuristics for Lifted Classical Planning. 94-102 - Johannes Czech, Patrick Korus, Kristian Kersting:
Improving AlphaZero Using Monte-Carlo Graph Search. 103-111 - Sankar Narayan Das, Swaprava Nath, Indranil Saha:
OMCoRP: An Online Mechanism for Competitive Robot Prioritization. 112-121 - Giuseppe De Giacomo, Marco Favorito:
Compositional Approach to Translate LTLf/LDLf into Deterministic Finite Automata. 122-130 - Dominik Drexler, Jendrik Seipp, David Speck:
Subset-Saturated Transition Cost Partitioning. 131-139 - Mahsa Ghasemi, Evan Scope Crafts, Bo Zhao, Ufuk Topcu:
Multiple Plans are Better than One: Diverse Stochastic Planning. 140-148 - Boris Goldin, Oren Salzman:
Approximate Bi-Criteria Search by Efficient Representation of Subsets of the Pareto-Optimal Frontier. 149-158 - Daniel Höller:
Translating Totally Ordered HTN Planning Problems to Classical Planning Problems Using Regular Approximation of Context-Free Languages. 159-167 - Daniel Höller, Gregor Behnke:
Loop Detection in the PANDA Planning System. 168-173 - Rostislav Horcík, Daniel Fiser:
Endomorphisms of Lifted Planning Problems. 174-183 - Shuli Hu, Daniel Damir Harabor, Graeme Gange, Peter J. Stuckey, Nathan R. Sturtevant:
Jump Point Search with Temporal Obstacles. 184-191 - Klaus Jansen, Alexandra Lassota, Marten Maack, Tytus Pikies:
Total Completion Time Minimization for Scheduling with Incompatibility Cliques. 192-200 - Thorsten Klößner, Jörg Hoffmann, Marcel Steinmetz, Álvaro Torralba:
Pattern Databases for Goal-Probability Maximization in Probabilistic Planning. 201-209 - Ryo Kuroiwa, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro, J. Christopher Beck:
LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions. 210-218 - Chao Lei, Nir Lipovetzky:
Width-Based Backward Search. 219-224 - Ruoxi Li, Sunandita Patra, Dana S. Nau:
Decentralized Refinement Planning and Acting. 225-233 - Hang Ma:
A Competitive Analysis of Online Multi-Agent Path Finding. 234-242 - Giulio Mazzi, Alberto Castellini, Alessandro Farinelli:
Rule-based Shielding for Partially Observable Monte-Carlo Planning. 243-251 - Francesco Percassi, Enrico Scala, Mauro Vallati:
Translations from Discretised PDDL+ to Numeric Planning. 252-261 - Tytus Pikies, Krzysztof Turowski, Marek Kubale:
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines. 262-270 - Florian Pommerening, Thomas Keller, Valentina Halasi, Jendrik Seipp, Silvan Sievers, Malte Helmert:
Dantzig-Wolfe Decomposition for Cost Partitioning. 271-280 - Majid Raeis, S. Jamaloddin Golestani:
Distributed Fair Scheduling for Information Exchange in Multi-Agent Systems. 281-289 - Ivan D. Rodriguez, Blai Bonet, Sebastian Sardiña, Hector Geffner:
Flexible FOND Planning with Explicit Fairness Assumptions. 290-298 - Enrico Scala, Alban Grastien:
Non-Deterministic Conformant Planning Using a Counterexample-Guided Incremental Compilation to Classical Planning. 299-307 - Sergej Scheck, Alexandre Niveau, Bruno Zanuttini:
Knowledge Compilation for Nondeterministic Action Languages. 308-316 - Jendrik Seipp:
Online Saturated Cost Partitioning for Classical Planning. 317-321 - Bojie Shen, Muhammad Aamir Cheema, Daniel Damir Harabor, Peter J. Stuckey:
Contracting and Compressing Shortest Path Databases. 322-330 - Shahaf S. Shperberg, Steven Danishevski, Ariel Felner, Nathan R. Sturtevant:
Iterative-deepening Bidirectional Heuristic Search with Restricted Memory. 331-339 - Shahaf S. Shperberg, Andrew Coles, Erez Karpas, Wheeler Ruml, Solomon Eyal Shimony:
Situated Temporal Planning Using Deadline-aware Metareasoning. 340-348 - Anubhav Singh, Nir Lipovetzky, Miquel Ramírez, Javier Segovia Aguas:
Approximate Novelty Search. 349-357 - David Speck, David Borukhson, Robert Mattmüller, Bernhard Nebel:
On the Compilability and Expressive Power of State-Dependent Action Costs. 358-366 - Liangde Tao, Lin Chen, Guochuan Zhang:
Scheduling Stochastic Jobs - Complexity and Approximation Algorithms. 367-375 - Álvaro Torralba, Jendrik Seipp, Silvan Sievers:
Automatic Instance Generation for Classical Planning. 376-384 - Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner, Han Zhang, Jiaoyang Li, T. K. Satish Kumar:
Conflict-Based Increasing Cost Search. 385-395 - Binghan Wu, Wei Bao, Dong Yuan, Bing Zhou:
Online Hedge Reservation for Diverse Plans and Competitive Analysis. 396-404 - Konstantin S. Yakovlev, Anton Andreychuk:
Towards Time-Optimal Any-Angle Path Planning With Dynamic Obstacles. 405-414 - Han Zhang, Neelesh Tiruviluamala, Sven Koenig, T. K. Satish Kumar:
Temporal Reasoning with Kinodynamic Networks. 415-425 - Yuening Zhang, Brian C. Williams:
Privacy-Preserving Algorithm for Decoupling of Multi-Agent Plans with Uncertainty. 426-434
Novel Applications Track
- Zhicheng An, Xiaoyan Cao, Yao Yao, Wanpeng Zhang, Lanqing Li, Yue Wang, Shihui Guo, Dijun Luo:
A Simulator-based Planning Framework for Optimizing Autonomous Greenhouse Control Strategy. 436-444 - Katherine Bianchini Esper, Felipe Meneguzzi:
Automated Design of fMRI Paradigms. 445-449 - Matteo Cardellini, Marco Maratea, Mauro Vallati, Gianluca Boleto, Luca Oneto:
In-Station Train Dispatching: A PDDL+ Planning Approach. 450-458 - Jonathan Chase, Tran Phong, Kang Long, Tony Le, Hoong Chuin Lau:
GRAND-VISION: An Intelligent System for Optimized Deployment Scheduling of Law Enforcement Agents. 459-467 - Supriyo Ghosh, Sean Laguna, Shiau Hong Lim, Laura Wynter, Hasan Poonawala:
A Deep Ensemble Method for Multi-Agent Reinforcement Learning: A Case Study on Air Traffic Control. 468-476 - Jiaoyang Li, Zhe Chen, Yi Zheng, Shao-Hung Chan, Daniel Harabor, Peter J. Stuckey, Hang Ma, Sven Koenig:
Scalable Rail Planning and Replanning: Winning the 2020 Flatland Challenge. 477-485 - Jamie O. Roberts, Georgios Mastorakis, Brad Lazaruk, Santiago Franco, Adam A. Stokes, Sara Bernardini:
vPlanSim: An Open Source Graphical Interface for the Visualisation and Simulation of AI Systems. 486-490 - Jamie O. Roberts, Santiago Franco, Adam A. Stokes, Sara Bernardini:
Autonomous Building of Structures in Unstructured Environments via AI Planning. 491-499 - Felix Winter, Christoph Mrkvicka, Nysret Musliu, Jakob Preininger:
Automated Production Scheduling for Artificial Teeth Manufacturing. 500-508
Special Track on Planning and Learning
- Jiayu Chen, Abhishek K. Umrawal, Tian Lan, Vaneet Aggarwal:
DeepFreight: A Model-free Deep-reinforcement-learning-based Algorithm for Multi-transfer Freight Delivery. 510-518 - Miquel Junyent, Vicenç Gómez, Anders Jonsson:
Hierarchical Width-Based Planning and Learning. 519-527 - Jasmeet Kaur, Ishani Chatterjee, Maxim Likhachev:
Speeding Up Search-Based Motion Planning using Expansion Delay Heuristics. 528-532 - Harsha Kokel, Arjun Manoharan, Sriraam Natarajan, Balaraman Ravindran, Prasad Tadepalli:
RePReL: Integrating Relational Planning and Reinforcement Learning for Effective Abstraction. 533-541 - Jiajing Ling, Kushagra Chandak, Akshat Kumar:
Integrating Knowledge Compilation with Reinforcement Learning for Routes. 542-550 - Ricardo Luna Gutierrez, Matteo Leonetti:
Meta Reinforcement Learning for Heuristic Planing. 551-559 - Canmanie T. Ponnambalam, Frans A. Oliehoek, Matthijs T. J. Spaan:
Abstraction-Guided Policy Recovery from Expert Demonstrations. 560-568 - Javier Segovia Aguas, Sergio Jiménez, Anders Jonsson:
Generalized Planning as Heuristic Search. 569-577 - Macheng Shen, Jonathan P. How:
Robust Opponent Modeling via Adversarial Ensemble Reinforcement Learning. 578-587 - Arambam James Singh, Akshat Kumar, Hoong Chuin Lau:
Learning and Exploiting Shaped Reward Models for Large Scale Multiagent RL. 588-596 - David Speck, André Biedenkapp, Frank Hutter, Robert Mattmüller, Marius Lindauer:
Learning Heuristic Selection with Dynamic Algorithm Configuration. 597-605 - Hari Teja Tatavarti, Prashant Doshi, Layton Hayes:
Data-Driven Decision-Theoretic Planning using Recurrent Sum-Product-Max Networks. 606-614
Special Track on Robotics
- Mark Nicholas Finean, Wolfgang Merkt, Ioannis Havoutis:
Predicted Composite Signed-Distance Fields for Real-Time Motion Planning in Dynamic Environments. 616-624 - Yohei Hayamizu, Saeid Amiri, Kishan Chandan, Keiki Takadama, Shiqi Zhang:
Guiding Robot Exploration in Reinforcement Learning via Automated Planning. 625-633 - Shuangyao Huang, Haibo Zhang, Zhiyi Huang:
E2Coop: Energy Efficient and Cooperative Obstacle Detection and Avoidance for UAV Swarms. 634-642 - Sarah Keren, Gerard Canal, Michael Cashmore:
Task-Aware Waypoint Sampling for Robotic Planning. 643-651 - Sung-Kyun Kim, Amanda Bouman, Gautam Salhotra, David D. Fan, Kyohei Otsu, Joel Burdick, Ali-akbar Agha-mohammadi:
PLGRIM: Hierarchical Value Learning for Large-scale Exploration in Unknown Environments. 652-662 - Raj Korpan, Susan L. Epstein:
Hierarchical Freespace Planning for Navigation in Unfamiliar Worlds. 663-672 - Alexander Kovalchuk, Shashank Shekhar, Ronen I. Brafman:
Verifying Plans and Scripts for Robotics Tasks Using Performance Level Profiles. 673-681
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-06-29 00:50 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:
