Making Shared Plans More Concise and Easier to Reason About. - Luke Hunsberger (ATAL, 1998)

Making SharedPlans more Concise and Easier to Reason about. - Luke Hunsberger (ICMAS, 1998)

Planning and Acting Together. - Barbara J. Grosz; Luke Hunsberger; Sarit Kraus (AI Mag., 1999)

A Mechanism for Group Decision Making in Collaborative Activity. - Luke Hunsberger; Massimo Zancanaro (AAAI/IAAI, 2000)

A Combinatorial Auction for Collaborative Planning. - Luke Hunsberger; Barbara J. Grosz (ICMAS, 2000)

Generating Bids for Group-Related Actions in the Context of Prior Commitments. - Luke Hunsberger (ATAL, 2001)

Algorithms for a Temporal Decoupling Problem in Multi-Agent Planning. - Luke Hunsberger (AAAI/IAAI, 2002)

Distributing the control of a temporal network among multiple agents. - Luke Hunsberger (AAMAS, 2003)

A framework for specifying group decision-making mechanisms. - Luke Hunsberger (AAMAS, 2005)

Whatever You Say. - Luke Hunsberger (JELIA, 2006)

The dynamics of intention in collaborative activity. - Barbara J. Grosz; Luke Hunsberger (Cogn. Syst. Res., 2006)

A Practical Temporal Constraint Management System for Real-Time Applications. - Luke Hunsberger (ECAI, 2008)

Dynamic intention structures I: a theory of intention representation. - Luke Hunsberger; Charles L. Ortiz Jr. (Auton. Agents Multi Agent Syst., 2008)

Just-in-Time Backfilling in Multi-Agent Scheduling. - Anthony Gallagher; Luke Hunsberger; Stephen F. Smith (FLAIRS, 2009)

Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies. - Luke Hunsberger (TIME, 2009)

A Fast Incremental Algorithm for Managing the Execution of Dynamically Controllable Temporal Networks. - Luke Hunsberger (TIME, 2010)

The Dynamic Controllability of Conditional STNs with Uncertainty - Luke Hunsberger; Roberto Posenato; Carlo Combi (CoRR, 2012)

An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty. - Carlo Combi; Luke Hunsberger; Roberto Posenato (ICAART (2), 2013)

An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty - Revisited. - Carlo Combi; Luke Hunsberger; Roberto Posenato (ICAART (Revised Selected Papers), 2013)

Magic Loops in Simple Temporal Networks with Uncertainty - Exploiting Structure to Speed Up Dynamic Controllability Checking. - Luke Hunsberger (ICAART (2), 2013)

Magic Loops and the Dynamic Controllability of Simple Temporal Networks with Uncertainty. - Luke Hunsberger (ICAART (Revised Selected Papers), 2013)

A Faster Execution Algorithm for Dynamically Controllable STNUs. - Luke Hunsberger (TIME, 2013)

Using Timed Game Automata to Synthesize Execution Strategies for Simple Temporal Networks with Uncertainty. - Alessandro Cimatti; Luke Hunsberger; Andrea Micheli; Marco Roveri (AAAI, 2014)

A Faster Algorithm for Checking the Dynamic Controllability of Simple Temporal Networks with Uncertainty. - Luke Hunsberger (ICAART (1), 2014)

New Techniques for Checking Dynamic Controllability of Simple Temporal Networks with Uncertainty. - Luke Hunsberger (ICAART (Revised Selected Papers), 2014)

Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation. - Alessandro Cimatti; Luke Hunsberger; Andrea Micheli; Roberto Posenato; Marco Roveri (TIME, 2014)

A Sound-and-Complete Propagation-Based Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks. - Luke Hunsberger; Roberto Posenato; Carlo Combi (TIME, 2015)

Checking the Dynamic Consistency of Conditional Temporal Networks with Bounded Reaction Times. - Luke Hunsberger; Roberto Posenato (ICAPS, 2016)

A New Approach to Checking the Dynamic Consistency of Conditional Simple Temporal Networks. - Luke Hunsberger; Roberto Posenato (CP, 2016)

Dynamic controllability via Timed Game Automata. - Alessandro Cimatti; Luke Hunsberger; Andrea Micheli; Roberto Posenato; Marco Roveri (Acta Informatica, 2016)

Efficient execution of dynamically controllable simple temporal networks with uncertainty. - Luke Hunsberger (Acta Informatica, 2016)

Incorporating Decision Nodes into Conditional Simple Temporal Networks. - Massimo Cairo; Carlo Combi; Carlo Comin; Luke Hunsberger; Roberto Posenato; Romeo Rizzi; Matteo Zavatteri (TIME, 2017)

A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results. - Massimo Cairo; Luke Hunsberger; Roberto Posenato; Romeo Rizzi (TIME, 2017)

Simpler and Faster Algorithm for Checking the Dynamic Consistency of Conditional Simple Temporal Networks. - Luke Hunsberger; Roberto Posenato (IJCAI, 2018)

Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty. - Massimo Cairo; Luke Hunsberger; Romeo Rizzi (TIME, 2018)

Sound-and-Complete Algorithms for Checking the Dynamic Controllability of Conditional Simple Temporal Networks with Uncertainty. - Luke Hunsberger; Roberto Posenato (TIME, 2018)

Reducing epsilon-DC Checking for Conditional Simple Temporal Networks to DC Checking. - Luke Hunsberger; Roberto Posenato (TIME, 2018)

Propagating Piecewise-Linear Weights in Temporal Networks. - Luke Hunsberger; Roberto Posenato (ICAPS, 2019)

Faster Dynamic-Consistency Checking for Conditional Simple Temporal Networks. - Luke Hunsberger; Roberto Posenato (ICAPS, 2020)

Simple Temporal Networks: A Practical Foundation for Temporal Representation and Reasoning (Invited Talk). - Luke Hunsberger; Roberto Posenato (TIME, 2021)

Speeding Up the RUL¯ Dynamic-Controllability-Checking Algorithm for Simple Temporal Networks with Uncertainty. - Luke Hunsberger; Roberto Posenato (AAAI, 2022)

Converting Simple Temporal Networks with Uncertainty into Dispatchable Form - Faster (Extended Abstract). - Luke Hunsberger; Roberto Posenato (TIME, 2023)

A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form. - Luke Hunsberger; Roberto Posenato (Inf. Comput., 2023)

Foundations of Dispatchability for Simple Temporal Networks with Uncertainty. - Luke Hunsberger; Roberto Posenato (ICAART (2), 2024)

Converting Simple Temporal Networks with Uncertainty into Minimal Equivalent Dispatchable Form. - Luke Hunsberger; Roberto Posenato (ICAPS, 2024)

A Faster Algorithm for Finding Negative Cycles in Simple Temporal Networks with Uncertainty. - Luke Hunsberger; Roberto Posenato (TIME, 2024)

Faster Algorithm for Converting an STNU into Minimal Dispatchable Form. - Luke Hunsberger; Roberto Posenato (TIME, 2024)

Robust Execution of Probabilistic STNs. - Luke Hunsberger; Roberto Posenato (TIME, 2024)