Luke Burks

Luke Burks

Auto-generated profile, based on publicly available information

Luke Burks

Department of Smead Aerospace Engineering Sciences, University of Colorado Boulder, Boulder, CO, USA

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2021 in Robotics and Autonomous Systems
Verified
Journal Article
Closed access
LBLuke Burks
Luke Burks
NANisar Ahmed
Nisar Ahmed
ILIan Loefgren
Ian Loefgren
LBLuke Barbier
Luke Barbier
JMJeremy Muesing
Jeremy Muesing
SVSousheel Vunnam
Sousheel Vunnam

27 August 2019 in IEEE Transactions on Robotics
Verified
Journal Article
Open access
LBLuke Burks
Luke Burks
ILIan Loefgren
Ian Loefgren
NANisar R. Ahmed
Nisar R. Ahmed
This article develops novel strategies for optimal planning with semantic observations using continuous state partially observable Markov decision processes (CPOMDPs). Two major innovations are presented in relation to Gaussian mixture (GM) CPOMDP policy approximation methods. While existing methods have many desirable theoretical properties, they are unable to efficiently represent and reason over hybrid continuous-discrete probabilistic models. The first major innovation is the derivation of closed-form variational Bayes GM approximations of point-based value iteration Bellman policy backups, using softmax models of continuous-discrete semantic observation probabilities. A key benefit of this approach is that dynamic decision making tasks can be performed with complex non-Gaussian uncertainties, while also exploiting continuous dynamic state-space models (thus avoiding cumbersome and costly discretization). The second major innovation is a new clustering-based technique for mixture condensation that scales well to very large GM policy functions and belief functions. Simulation results for a target search and interception task with semantic observations show that the GM policies resulting from these innovations are more effective than those produced by other state-of-the-art policy approximations, but require significantly less modeling overhead and online runtime cost. Additional results show the robustness of this approach to model errors and scaling to higher dimensions.

19 April 2023 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
LBLuke Burks
Luke Burks
HRHunter M. Ray
Hunter M. Ray
JMJamison McGinley
Jamison McGinley
SVSousheel Vunnam
Sousheel Vunnam
NANisar R. Ahmed
Nisar R. Ahmed
The ability of autonomous robots to model, communicate, and act on semantic “soft data” remains challenging. The human-assisted robotic planning and sensing (HARPS) framework is presented for active semantic sensing and planning in human–robot teams to address these gaps by formally combining the benefits of online sampling-based partially observable Markov decision process policies, multimodal human–robot interaction, and Bayesian data fusion. HARPS lets humans impose model structure and extend the range of soft data by sketching and labeling new semantic features in uncertain environments. Dynamic model updating lets robotic agents actively query humans for novel and relevant semantic data, thereby improving model and state beliefs for improved online planning. Simulations of a unmanned aerial vehicle-enabled target search in a large-scale partially structured environment show significant improvements in time and beliefs required for interception versus conventional planning with robot-only sensing. A human subject study in the same environment shows an average doubling in dynamic target capture rate compared to the lone robot case and highlights the robustness of HARPS over a range of user characteristics and interaction modalities.

1 February 2021 in Journal of Aerospace Information Systems
Verified
Journal Article
Closed access
JMJeremy Muesing
Jeremy Muesing
NANisar R. Ahmed
Nisar R. Ahmed
LBLuke Burks
Luke Burks
MIMichael Iuzzolino
Michael Iuzzolino
DSDanielle Albers Szafir
Danielle Albers Szafir
This work examines the problem of fusing human operator observations with probabilistic information extracted by an automated data fusion system, in the context of dynamic multitarget track charact...