AAAI-2024-Papers Application Planning, Routing, and Scheduling 🆔 Title Repo Paper Video Learning Planning Domains from Non-redundant Fully-Observed Traces: Theoretical Foundations and Complexity Analysis ➖ Dealing with Numeric and Metric Time Constraints in PDDL3 via Compilation to Numeric Planning ➖ The Complexity of Optimizing Atomic Congestion ➖ Stop! Planner Time: Metareasoning for Probabilistic Planning Using Learned Performance Profiles ➖ Can LLMs Fix Issues with Reasoning Models? Towards More Likely Models for AI Planning ➖ Symbolic Numeric Planning with Patterns ➖ Learning Domain-Independent Heuristics for Grounded and Lifted Planning ➖ Approximate Distance Oracle for Fault-Tolerant Geometric Spanners ➖ Optimizing the Optimization of Planning Domains by Automatic Action Schema Splitting ➖ An Effective Polynomial Technique for Compiling Conditional Effects Away ➖ GOALNET: Interleaving Neural Goal Predicate Inference with Classical Planning for Generalization in Robot Instruction Following ➖ SayCanPay: Heuristic Planning with Large Language Models Using Learnable Domain Knowledge ➖ A Surprisingly Simple Continuous-Action POMDP Solver: Lazy Cross-Entropy Search Over Policy Trees ➖ Optimizing Local Satisfaction of Long-Run Average Objectives in Markov Decision Processes ➖ Monte Carlo Tree Search in the Presence of Transition Uncertainty ➖ Learning Safe Action Models with Partial Observability ➖ Generalized Planning for the Abstraction and Reasoning Corpus ➖ Simplifying Complex Observation Models in Continuous POMDP Planning with Probabilistic Guarantees and Practice ➖ Learning to Optimize Permutation Flow Shop Scheduling via Graph-Based Imitation Learning ➖ NaRuto: Automatically Acquiring Planning Models from Narrative Texts ➖ On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence ➖ PRP Rebooted: Advancing the State of the Art in FOND Planning ➖ Abstract Action Scheduling for Optimal Temporal Planning via OMT ➖ Generalising Planning Environment Redesign ➖ When CEGAR Meets Regression: A Love Story in Optimal Classical Planning ➖ Efficient Constraint Generation for Stochastic Shortest Path Problems ➖ Generalized Planning in PDDL Domains with Pretrained Large Language Models ➖ Equity-Transformer: Solving NP-Hard Min-Max Routing Problems as Sequential Generation with Equity Context ➖ Distilling Autoregressive Models to Obtain High-Performance Non-autoregressive Solvers for Vehicle Routing Problems with Faster Inference Speed ➖ GLOP: Learning Global Partition and Local Construction for Solving Large-Scale Routing Problems in Real-Time ➖ Learning-Augmented Online Algorithm for Two-Level Ski-Rental Problem ➖
