EUVIMED · CrossrefJournal
Proceedings of the International Conference on Automated Planning and Scheduling
ISSN 2334-0843 · Association for the Advancement of Artificial Intelligence (AAAI)
Latest articles
Simplifying Planning Tasks with Fact-Level Relevance Analysis
Subgoaling Relaxation-based Heuristics for Numeric Planning with Infinite Actions
A Constraint Formulation for Domain Repair with Ground or Lifted Test Plans
Optimal Solutions for the Moving Target Vehicle Routing Problem via Branch-and-Price with Relaxed Continuity
Complete and Optimal Robust Planning Against Nature
Compiling Expressive Planning with Data Types
Incremental LTLf Synthesis
When Both Grounding and Not Grounding Are Bad – a Partially Grounded Encoding of Planning into SAT
Dynamic Shelf Arrangement and Task Assignment with Stable Matching for Multi-Agent Pickup and Delivery with Multi-Item Packing Problem
Fully Packed and Ready to Go: High-Density, Rearrangement-Free, Grid-Based Storage and Retrieval
Scalable Algorithms with Provable Optimality Bounds for the Multiple Watchman Route Problem
PDDL Axioms Are Equivalent to Least Fixed Point Logic
PING: A Physics-Informed Neuro-Symbolic Generator for Continuous-Time Planning
Optimal Path Planning in Hostile Environments
Memory Assignment for Finite-Memory Strategies in Adversarial Patrolling Games
Leveraging the Value of Information in POMDP Planning
I Always Told My Mom That Order Is Overrated: Unordered HTN Planning Is in PSPACE and Models Problems Beyond STRIPS
Domain-Independent Dynamic Programming with Constraint Propagation
Reversibility and Reachability in HTN Planning: Formalization and Computational Complexities in the Totally-Ordered Setting
Relaxing Is Hard: Complexity Results for Lifted Partial Order Causal Link Planning
Risk-Bounded Multi-Agent Visual Navigation via Iterative Risk Allocation
H-ANTS: Hierarchical Ant System with Insert-and-Prune Charging for Capacitated Electric Vehicle Routing
Planning with Minimal Disruption
Planning as Goal Recognition: Deriving Heuristics from Intention Models
Beyond Pruning: Leveraging Dominance Relations for Heuristic Propagation
Finding a Dominating State in a Haystack: Efficient Data Structures for Dominance Pruning
AUPO – Abstracted Until Proven Otherwise: A Reward Distribution Based Abstraction Algorithm
Optimal Clifford Synthesis as Planning
Proactive Assistance Agent with Online Goal Recognition
Complexity Results for Fixing Classical Models Using LTL to Express Which Solutions Are (Un)Desired
EUVIMED