ICAPS-2022 Schedule Overview
Detailed Schedule
Tuesday 21
6:00 UTC | Opening (start: +30min) | |
7:00 UTC | Invited Talk: Malte Helmert | |
8:00 UTC | Social: Get Together | |
9:00 UTC | (1a) Planning Representations and Scheduling Session Chair: Neil Yorke-Smith |
(1b) Verification Session Chair: Erez Karpas |
Generalized Linear Integer Numeric Planning
(Main Track) |
Neural Network Action Policy Verification via Predicate Abstraction
(Main Track) |
|
Uniform Machine Scheduling with Predictions
(Main Track) |
Debugging a Policy: Automatic Action-Policy Testing in AI Planning
(Main Track) |
|
Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width
(Main Track) |
Decidability and Complexity of Action-Based Temporal Planning over Dense Time
(Journal Presentations Track) |
|
10:00 UTC | (2a) Reinforcement Learning Session Chair: Vaneet Aggarwal |
(2b) Heuristics in Classical Planning Session Chair: Jörg Hoffmann |
Deep reinforcement learning for a multi-objective online order batching problem
(Industry and Applications Track) |
Efficient Computation and Informative Estimation of h+ by Integer and Linear Programming
(Main Track) |
|
Reinforcement Learning Approach to Solve Dynamic Bi-Objective Police Patrol Dispatching and Rescheduling Problem
(Industry and Applications Track) |
Detecting Unsolvability Based on Separating Functions
(Main Track) |
|
Learning Multi-agent Action Coordination via Electing First-move Agent
(Planning and Learning Track) |
New Refinement Strategies for Cartesian Abstractions
(Main Track) |
|
11:00 UTC | Poster and Demo Session | |
13:00 UTC | (3a) Model-Based Reasoning in Classical Planning Session Chair: Michael Katz |
(3b) Learning in Scheduling Applications Session Chair: Nysret Musliu |
Loopless Top-k Planning
(Main Track) |
Stochastic Resource Optimization over Heterogeneous Graph Neural Networks for Failure-Predictive Maintenance Scheduling
(Industry and Applications Track) |
|
Encoding Lifted Classical Planning in Propositional Logic
(Main Track) |
OFFICERS: Operational Framework For Intelligent Crime-and-Emergency Response Scheduling
(Industry and Applications Track) |
|
Classical Planning as QBF without Grounding
(Main Track) |
Reinforcement Learning of Dispatching Strategies for Large-Scale Industrial Scheduling
(Planning and Learning Track) |
|
14:00 UTC | (4a) Search Session Chair: Michael Katz |
(4b) Optimal Planning Session Chair: Jörg Hoffmann |
Beam Search: Faster and Monotonic
(Main Track) |
Optimal Mixed Strategies for Cost-Adversarial Planning Games
(Main Track) |
|
Best-First Width Search for Lifted Classical Planning
(Main Track) |
It Costs to Get Costs! A Heuristic-Based Scalable Goal Assignment Algorithm for Multi-Robot Systems
(Main Track) |
|
Beyond Stars - Generalized Topologies for Decoupled Search
(Main Track) |
Optimising the Stability in Plan Repair via Compilation
(Main Track) |
|
15:00 UTC | Career Development Panel | |
16:00 UTC | (5a) Problem Reformulation Session Chair: Sunandita Patra |
(5b) Heuristics and Heuristic Search Session Chair: Jendrik Seipp |
A Compilation Based Approach to Finding Centroids and Minimum Covering States in Planning
(Main Track) |
Operator-Potentials in Symbolic Search: From Forward to Bi-Directional Search
(Main Track) |
|
Who Needs These Operators Anyway: Top Quality Planning with Operator Subset Criteria
(Main Track) |
Cost Partitioning Heuristics for Stochastic Shortest Path Problems
(Main Track) |
|
A Network Flow Interpretation of Robust Goal Legibility in Path Finding
(Human-Aware Planning and Scheduling Track) |
Iterative Depth-First Search for Fully Observable Non-Deterministic Planning
(Main Track) |
|
17:00 UTC | (6a) Multi-Agent Path Finding Session Chair: Hang Ma |
(6b) Deep Learning Session Chair: Scott Sanner |
Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution
(Main Track) |
Learning To Estimate Search Progress Using Sequence Of States
(Main Track) |
|
Conflict-Based Search for Explainable Multi-Agent Path Finding
(Human-Aware Planning and Scheduling Track) |
Width-Based Planning and Active Learning for Atari
(Planning and Learning Track) |
|
Conflict-Based Search for the Virtual Network Embedding Problem
(Main Track) |
An End-to-End Automatic Cache Replacement Policy Using Deep Reinforcement Learning
(Industry and Applications Track) |
|
18:00 UTC | Poster and Demo Session | |
20:00 UTC | (7a) Probabilistic Planning Session Chair: Sandhya Saisubramanian |
(7b) Multi-Agent Planning and Scheduling Session Chair: Stephen Smith |
Anxiety-Sensitive Planning: From Formal Foundations to Algorithms and Applications
(Human-Aware Planning and Scheduling Track) |
Simple Temporal Networks for Improvisational Teamwork
(Main Track) |
|
Planning for Risk-Aversion and Expected Value in MDPs
(Main Track) |
Talking Trucks: Decentralized Collaborative Multi-Agent Order Scheduling for Self-Organizing Logistics
(Industry and Applications Track) |
|
Task-Guided Inverse Reinforcement Learning Under Partial Information
(Main Track) |
Distributed Fleet Management in Noisy Environments via Model-Predictive Control
(Planning and Learning Track) |
|
21:00 UTC | Social: Speed Gathering | |
22:00 UTC | (8a) Hierarchical Task Networks Session Chair: Shirin Sohrabi |
(8b) Rewards in Reinforcement Learning Session Chair: Alberto Camacho |
On the Expressive Power of Planning Formalisms in Conjunction with LTL
(Main Track) |
Inferring Probabilistic Reward Machines from Non-Markovian Reward Signals for Reinforcement Learning
(Planning and Learning Track) |
|
Flexible FOND HTN planning: A Complexity Analysis
(Main Track) |
Active Grammatical Inference for Non-Markovian Planning
(Planning and Learning Track) |
|
Analyzing the Efficacy of Flexible Execution, Replanning, and Plan Optimization for a Planetary Lander
(Industry and Applications Track) |
Reward Machines: Exploiting Reward Function Structure in Reinforcement Learning
(Journal Presentations Track) |
|
23:00 UTC | Invited Talk: Sven Koenig | |
24:00 UTC | Social: Games |
Wednesday 22
7:00 UTC | (9a) Search Session Chair: Alexander Shleyfman |
(9b) Multi-Agent Planning Session Chair: Antonin Komenda |
Crossword Puzzle Resolution via Monte Carlo Tree Search
(Main Track) |
Optimal Mixed Strategies for Cost-Adversarial Planning Games
(Main Track) |
|
Best-First Width Search for Lifted Classical Planning
(Main Track) |
It Costs to Get Costs! A Heuristic-Based Scalable Goal Assignment Algorithm for Multi-Robot Systems
(Main Track) |
|
Iterative Depth-First Search for Fully Observable Non-Deterministic Planning
(Main Track) |
Distributed Fleet Management in Noisy Environments via Model-Predictive Control
(Planning and Learning Track) |
|
8:00 UTC | Social: Get Together | |
9:00 UTC | (10a) Goal and Plan Recognition Session Chair: Sarah Keren |
(10b) Scheduling Applications Session Chair: Hoong Chuin Lau |
Models of Intervention: Helping Agents and Human Users Avoid Undesirable Outcomes
(Journal Presentations Track) |
Hyper-heuristics for Personnel Scheduling Domains
(Industry and Applications Track) |
|
A Compilation Based Approach to Finding Centroids and Minimum Covering States in Planning
(Main Track) |
An Exact Algorithm for the Linear Tape Scheduling Problem
(Main Track) |
|
A Network Flow Interpretation of Robust Goal Legibility in Path Finding
(Human-Aware Planning and Scheduling Track) |
OFFICERS: Operational Framework For Intelligent Crime-and-Emergency Response Scheduling
(Industry and Applications Track) |
|
10:00 UTC | (11a) Heuristics in Classical and Multi-Objective Planning Session Chair: Florian Pommerening |
(11b) Applications Session Chair: Charles Gretton |
Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other Methods
(Planning and Learning Track) |
Building resource-dependent conditional plans for an Earth monitoring satellite
(Industry and Applications Track) |
|
On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond
(Main Track) |
A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Roaming Delivery Locations
(Main Track) |
|
Admissible Heuristics for Multi-Objective Planning
(Main Track) |
Optimisation of Annual Planned Rail Maintenance
(Journal Presentations Track) |
|
11:00 UTC | Competition Panel | |
13:00 UTC | (12a) Numeric Planning Session Chair: Patrik Haslum |
(12b) Deep Learning Session Chair: Malte Helmert |
LM-Cut Heuristics for Optimal Linear Numeric Planning
(Main Track) |
Neural Network Action Policy Verification via Predicate Abstraction
(Main Track) |
|
Efficient Temporal Piecewise-Linear Numeric Planning with Lazy Consistency Checking
(Journal Presentations Track) |
Debugging a Policy: Automatic Action-Policy Testing in AI Planning
(Main Track) |
|
Generalized Linear Integer Numeric Planning
(Main Track) |
Learning Multi-agent Action Coordination via Electing First-move Agent
(Planning and Learning Track) |
|
14:00 UTC | (13a) Epistemic Planning Session Chair: Andrea Orlandini |
(13b) Heuristics in Classical Planning Session Chair: Alvaro Torralba |
Resolving Misconceptions about the Plans of Agents via Theory of Mind
(Human-Aware Planning and Scheduling Track) |
Biased Exploration for Satisficing Heuristic Search
(Main Track) |
|
Efficient Multi-agent Epistemic Planning: Teaching Planners About Nested Belief
(Journal Presentations Track) |
Efficient Computation and Informative Estimation of h+ by Integer and Linear Programming
(Main Track) |
|
Knowledge-based programs as building blocks for planning
(Journal Presentations Track) |
Detecting Unsolvability Based on Separating Functions
(Main Track) |
|
15:00 UTC | Social: Pseudonym Get Together | |
16:00 UTC | Invited Talk: Emma Brunskill | |
17:00 UTC | (14a) Search Session Chair: Oren Salzman |
(14b) Verification Session Chair: Andrea Micheli |
On Speeding up Methods for Identifying Redundant Actions in Plans
(Main Track) |
Compiling HTN Plan Verification Problems into HTN Planning Problems
(Main Track) |
|
A*pex: Approximate and Efficient Multi-Objective Search on Graphs
(Main Track) |
The Power of Reformulation: PDDL+ Validation Through Planning
(Main Track) |
|
Merge-and-Shrink: A Compositional Theory of Transformations of Factored Transition Systems
(Journal Presentations Track) |
Congestion-Aware Policy Synthesis for Multirobot Systems
(Journal Presentations Track) |
|
18:00 UTC | Poster and Demo Session | |
20:00 UTC | (15a) Planning Decompositions and Learning Session Chair: Scott Sanner |
(15b) Explainable Planning and Scheduling Session Chair: Matthew Gombolay |
Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits
(Planning and Learning Track) |
VizXP: A Visualization Framework for Conveying Explanations to Users in Model Reconciliation Problems
(Human-Aware Planning and Scheduling Track) |
|
Width-Based Planning and Active Learning for Atari
(Planning and Learning Track) |
Explaining Preference-driven Schedules: the EXPRES Framework
(Human-Aware Planning and Scheduling Track) |
|
Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width
(Main Track) |
RADAR-X: An Interactive Mixed Initiative Planning Interface Pairing Contrastive Explanations and Revised Plan Suggestions
(Industry and Applications Track) |
|
21:00 UTC | Social: Pseudonym Get Together | |
22:00 UTC | (16a) Multi-Agent Planning Session Chair: Jiaoyang Li |
(16b) Reinforcement Learning Session Chair: Anders Jonsson |
Multi-Agent Tree Search with Dynamic Reward Shaping
(Planning and Learning Track) |
Beyond Value: CheckList for Testing Inferences in Planning-Based RL
(Planning and Learning Track) |
|
Conflict-Based Search for Explainable Multi-Agent Path Finding
(Human-Aware Planning and Scheduling Track) |
Verifiable and Compositional Reinforcement Learning Systems
(Planning and Learning Track) |
|
Conflict-Based Search for the Virtual Network Embedding Problem
(Main Track) |
Tuning the Hyperparameters of Anytime Planning: A Metareasoning Approach with Deep Reinforcement Learning
(Planning and Learning Track) |
|
23:00 UTC | (17a) Applications Session Chair: William Yeoh |
(17b) Path and Motion Planning Session Chair: Sven Koenig |
Joint Pricing and Matching for City-Scale Ride-Pooling
(Industry and Applications Track) |
Improving Time-dependent Contraction Hierarchies
(Main Track) |
|
Planning Satellite Swarm Measurements for Earth Science Models: Comparing Constraint Processing and MILP methods
(Industry and Applications Track) |
Lazy Rearrangement Planning in Confined Spaces
(Main Track) |
|
Stochastic Resource Optimization over Heterogeneous Graph Neural Networks for Failure-Predictive Maintenance Scheduling
(Industry and Applications Track) |
Euclidean Distance-Optimal Post-Processing of Grid-Based Paths
(Main Track) |
|
24:00 UTC | Poster and Demo Session |
Thursday 23
7:00 UTC | (18a) Classical Planning Session Chair: Roni Stern |
(18b) Robotics Session Chair: Oren Salzman |
On Speeding up Methods for Identifying Redundant Actions in Plans
(Main Track) |
Conflict-Directed Diverse Planning for Logic-Geometric Programming
(Main Track) |
|
Beyond Stars - Generalized Topologies for Decoupled Search
(Main Track) |
DOMA: Deep Smooth Trajectory Generation Learning for Real-time UAV Motion Planning
(Planning and Learning Track) |
|
Merge-and-Shrink: A Compositional Theory of Transformations of Factored Transition Systems
(Journal Presentations Track) |
Congestion-Aware Policy Synthesis for Multirobot Systems
(Journal Presentations Track) |
|
8:00 UTC | Social: Games | |
9:00 UTC | (19a) Expressivity and Complexity Session Chair: Erez Karpas |
(19b) Path Finding Session Chair: Roni Stern |
On the Expressive Power of Planning Formalisms in Conjunction with LTL
(Main Track) |
Multi-Agent Path Finding with Temporal Jump Point Search
(Main Track) |
|
Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits
(Planning and Learning Track) |
Solving Simultaneous Target Assignment and Path Planning Efficiently with Time-Independent Execution
(Main Track) |
|
Flexible FOND HTN planning: A Complexity Analysis
(Main Track) |
Improving Time-dependent Contraction Hierarchies
(Main Track) |
|
10:00 UTC | (20a) Explainable Planning and Scheduling Session Chair: Christina Burt |
(20b) Heuristics and Heuristic Search Session Chair: Malte Helmert |
Evaluating Plan-Property Dependencies: A Web-Based Platform and User Study
(Human-Aware Planning and Scheduling Track) |
Learning To Estimate Search Progress Using Sequence Of States
(Main Track) |
|
Contrastive Explanations of Plans Through Model Restrictions
(Journal Presentations Track) |
Operator-Potentials in Symbolic Search: From Forward to Bi-Directional Search
(Main Track) |
|
Explaining Preference-driven Schedules: the EXPRES Framework
(Human-Aware Planning and Scheduling Track) |
Cost Partitioning Heuristics for Stochastic Shortest Path Problems
(Main Track) |
|
11:00 UTC | Poster and Demo Session | |
13:00 UTC | Industry Panel | |
14:00 UTC | (21a) Applications Session Chair: Christophe Guettier |
(21b) Temporal Planning and Reinforcement Learning Session Chair: Pradeep Varakantham |
Joint Pricing and Matching for City-Scale Ride-Pooling
(Industry and Applications Track) |
TempAMLSI: Temporal Action Model Learning based on STRIPS translation
(Planning and Learning Track) |
|
A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Roaming Delivery Locations
(Main Track) |
Active Grammatical Inference for Non-Markovian Planning
(Planning and Learning Track) |
|
An Exact Algorithm for the Linear Tape Scheduling Problem
(Main Track) |
Decidability and Complexity of Action-Based Temporal Planning over Dense Time
(Journal Presentations Track) |
|
15:00 UTC | Social: Puzzle Game Team Challenge | |
16:00 UTC | (22a) Reinforcement Learning Session Chair: Ronen Brafman |
(22b) Robotics Session Chair: Andrea Orlandini |
Task-Guided Inverse Reinforcement Learning Under Partial Information
(Main Track) |
Lazy Rearrangement Planning in Confined Spaces
(Main Track) |
|
Inferring Probabilistic Reward Machines from Non-Markovian Reward Signals for Reinforcement Learning
(Planning and Learning Track) |
Analyzing the Efficacy of Flexible Execution, Replanning, and Plan Optimization for a Planetary Lander
(Industry and Applications Track) |
|
Reward Machines: Exploiting Reward Function Structure in Reinforcement Learning
(Journal Presentations Track) |
Euclidean Distance-Optimal Post-Processing of Grid-Based Paths
(Main Track) |
|
17:00 UTC | (23a) Abstraction Heuristics Session Chair: Silvan Sievers |
(23b) Reinforcement Learning Session Chair: Hector Geffner |
Merge and Shrink Abstractions for Temporal Planning
(Main Track) |
Beyond Value: CheckList for Testing Inferences in Planning-Based RL
(Planning and Learning Track) |
|
Pattern Selection Strategies for Pattern Databases in Probabilistic Planning
(Main Track) |
Verifiable and Compositional Reinforcement Learning Systems
(Planning and Learning Track) |
|
New Refinement Strategies for Cartesian Abstractions
(Main Track) |
Tuning the Hyperparameters of Anytime Planning: A Metareasoning Approach with Deep Reinforcement Learning
(Planning and Learning Track) |
|
18:00 UTC | Invited Talk: Sidd Srinivasa | |
20:00 UTC | (24a) Reinforcement Learning in Applications Session Chair: Matthew Gombolay |
(24b) User Interactions and Top-Quality Planning Session Chair: Sarath Sreedharan |
Deep reinforcement learning for a multi-objective online order batching problem
(Industry and Applications Track) |
Actor-focused interactive visualization for AI Planning
(Human-Aware Planning and Scheduling Track) |
|
An End-to-End Automatic Cache Replacement Policy Using Deep Reinforcement Learning
(Industry and Applications Track) |
Who Needs These Operators Anyway: Top Quality Planning with Operator Subset Criteria
(Main Track) |
|
Reinforcement Learning of Dispatching Strategies for Large-Scale Industrial Scheduling
(Planning and Learning Track) |
Models of Intervention: Helping Agents and Human Users Avoid Undesirable Outcomes
(Journal Presentations Track) |
|
21:00 UTC | Social: Get Together | |
22:00 UTC | (25a) Heuristic Search Session Chair: Alexander Shleyfman |
(25b) Epistemic Planning Session Chair: Patrik Haslum |
Beam Search: Faster and Monotonic
(Main Track) |
Resolving Misconceptions about the Plans of Agents via Theory of Mind
(Human-Aware Planning and Scheduling Track) |
|
Biased Exploration for Satisficing Heuristic Search
(Main Track) |
Efficient Multi-agent Epistemic Planning: Teaching Planners About Nested Belief
(Journal Presentations Track) |
|
A*pex: Approximate and Efficient Multi-Objective Search on Graphs
(Main Track) |
Knowledge-based programs as building blocks for planning
(Journal Presentations Track) |
|
23:00 UTC | (26a) Heuristics Session Chair: Masataro Asai |
(26b) Scheduling Session Chair: Neil Yorke-Smith |
Reinforcement Learning for Classical Planning: Viewing Heuristics as Dense Reward Generators
(Planning and Learning Track) |
Solving Job-Shop Scheduling Problems with QUBO-based Specialized Hardware
(Main Track) |
|
Admissible Heuristics for Multi-Objective Planning
(Main Track) |
Assignment and Prioritization Of Tasks With Uncertain Durations For Satisfying Makespans In Decentralized Execution
(Main Track) |
|
LM-Cut Heuristics for Optimal Linear Numeric Planning
(Main Track) |
Uniform Machine Scheduling with Predictions
(Main Track) |
|
24:00 UTC | Poster and Demo Session |
Friday 24
7:00 UTC | Invited Talk: Tim Miller | |
8:00 UTC | Social: Open Discussion | |
9:00 UTC | (27a) Reformulation Session Chair: Lukas Chrpa |
(27b) Probabilistic Planning Session Chair: Felipe Trevizan |
Compiling HTN Plan Verification Problems into HTN Planning Problems
(Main Track) |
Anxiety-Sensitive Planning: From Formal Foundations to Algorithms and Applications
(Human-Aware Planning and Scheduling Track) |
|
Optimising the Stability in Plan Repair via Compilation
(Main Track) |
Planning for Risk-Aversion and Expected Value in MDPs
(Main Track) |
|
The Power of Reformulation: PDDL+ Validation Through Planning
(Main Track) |
Pattern Selection Strategies for Pattern Databases in Probabilistic Planning
(Main Track) |
|
10:00 UTC | (28a) Model-Based Reasoning in Classical Planning Session Chair: Enrico Scala |
(28b) Temporal Planning Session Chair: Ivan Serina |
Loopless Top-k Planning
(Main Track) |
TempAMLSI: Temporal Action Model Learning based on STRIPS translation
(Planning and Learning Track) |
|
Encoding Lifted Classical Planning in Propositional Logic
(Main Track) |
Merge and Shrink Abstractions for Temporal Planning
(Main Track) |
|
Classical Planning as QBF without Grounding
(Main Track) |
Efficient Temporal Piecewise-Linear Numeric Planning with Lazy Consistency Checking
(Journal Presentations Track) |
|
11:00 UTC | Poster and Demo Session | |
13:00 UTC | (29a) Multi-Agent and Tree Search Session Chair: Maxim Likhachev |
(29b) Motion Planning and Deep RL Session Chair: Martim Brandao |
Crossword Puzzle Resolution via Monte Carlo Tree Search
(Main Track) |
Conflict-Directed Diverse Planning for Logic-Geometric Programming
(Main Track) |
|
Multi-Agent Path Finding with Temporal Jump Point Search
(Main Track) |
Reinforcement Learning Approach to Solve Dynamic Bi-Objective Police Patrol Dispatching and Rescheduling Problem
(Industry and Applications Track) |
|
Multi-Agent Tree Search with Dynamic Reward Shaping
(Planning and Learning Track) |
DOMA: Deep Smooth Trajectory Generation Learning for Real-time UAV Motion Planning
(Planning and Learning Track) |
|
14:00 UTC | Community Meeting | |
16:00 UTC | (30a) Scheduling (delayed by 20min) Session Chair: Andrea Micheli |
(30b) Heuristics in Classical Planning (delayed by 20min) Session Chair: Masataro Asai |
Simple Temporal Networks for Improvisational Teamwork
(Main Track) |
Reinforcement Learning for Classical Planning: Viewing Heuristics as Dense Reward Generators
(Planning and Learning Track) |
|
Talking Trucks: Decentralized Collaborative Multi-Agent Order Scheduling for Self-Organizing Logistics
(Industry and Applications Track) |
Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other Methods
(Planning and Learning Track) |
|
Assignment and Prioritization Of Tasks With Uncertain Durations For Satisfying Makespans In Decentralized Execution
(Main Track) |
On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond
(Main Track) |
|
17:00 UTC | (31a) User Interfaces for Explainable Planning (delayed by 20min) Session Chair: Christabel Wayllace |
(31b) Scheduling (delayed by 20min) Session Chair: Christophe Guettier |
VizXP: A Visualization Framework for Conveying Explanations to Users in Model Reconciliation Problems
(Human-Aware Planning and Scheduling Track) |
Solving Job-Shop Scheduling Problems with QUBO-based Specialized Hardware
(Main Track) |
|
Evaluating Plan-Property Dependencies: A Web-Based Platform and User Study
(Human-Aware Planning and Scheduling Track) |
Building resource-dependent conditional plans for an Earth monitoring satellite
(Industry and Applications Track) |
|
Actor-focused interactive visualization for AI Planning
(Human-Aware Planning and Scheduling Track) |
Hyper-heuristics for Personnel Scheduling Domains
(Industry and Applications Track) |
|
RADAR-X: An Interactive Mixed Initiative Planning Interface Pairing Contrastive Explanations and Revised Plan Suggestions
(Industry and Applications Track) |
Planning Satellite Swarm Measurements for Earth Science Models: Comparing Constraint Processing and MILP methods
(Industry and Applications Track) |
|
Contrastive Explanations of Plans Through Model Restrictions
(Journal Presentations Track) |
Optimisation of Annual Planned Rail Maintenance
(Journal Presentations Track) |
|
19:00 UTC | Closing and Final Get Together |