← Search

Michael Cashmore

5 accepted papers

2024

Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates

AAAI 2024technical

Discrete optimization belongs to the set of N P-hard problems, spanning fields such as mixed-integer programming and combinatorial optimization. A current standard approach to solving convex discrete optimization problems is the use of cutting-plane algorithms, which reach optimal solutions by itera…

Cited by 0SourcePDFScholar
2023

A Logic-based Explanation Generation Framework for Classical and Hybrid Planning Problems (Extended Abstract)

IJCAI 2023poster

In human-aware planning systems, a planning agent might need to explain its plan to a human user when that plan appears to be non-feasible or sub-optimal. A popular approach, called model reconciliation, has been proposed as a way to bring the model of the human user closer to the agent's model. In…

2020

Intent-driven Strategic Tactical Planning for Autonomous Site Inspection using Cooperative Drones

IROS 2020poster

Realization of industry-scale, goal-driven, autonomous systems with AI planning technology faces several challenges: flexibly specifying planning goal states in varying situations, synthesizing plans in large state spaces, re-planning in dynamic situations, and facilitating humans to supervise, give…

Cited by 3SourceScholar
2018

Strategic-Tactical Planning for Autonomous Underwater Vehicles over Long Horizons

IROS 2018poster

In challenging environments where human intervention is expensive, robust and persistent autonomy is a key requirement. AI Planners can efficiently construct plans to achieve this long-term autonomous behaviour. However, in plans which are expected to last over days, or even weeks, the size of the s…

Cited by 28SourceScholar