Xiaodong Lan

Xiaodong Lan

Auto-generated profile, based on publicly available information

Xiaodong Lan

Department of Mechanical Engineering, Boston University, Boston, MA 02215, USA

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
16 September 2016 in IEEE Transactions on Robotics
Verified
Journal Article
Open access
XLXiaodong Lan
Xiaodong Lan
MSMac Schwager
Mac Schwager
This paper considers the problem of planning trajectories for both single and multiple sensing robots to best estimate a spatiotemporal field in a dynamic environment. The robots use a Kalman filter to maintain an estimate of the field value and to compute the error covariance matrix of the estimate. Two new sampling-based path-planning algorithms (rapidly expanding random cycles and an improved variant of rapidly expanding random cycles) are proposed to find periodic trajectories for the sensing robots that minimize the largest eigenvalue of the error covariance matrix over an infinite horizon. The algorithms are proven to find the minimum infinite horizon cost cycle in a random graph, which grows by successively adding random points. The algorithms leverage recently developed methods for periodic Riccati recursions to efficiently compute the infinite horizon cost of the cycles, and they use the monotonicity property of the Riccati recursion to efficiently compare the costs of different cycles without explicitly computing their costs. The algorithms are demonstrated in a study using National Oceanic and Atmospheric Administration data to plan sensing trajectories in the Caribbean Sea. Our algorithms significantly outperform random, greedy, and receding horizon approaches in this environment.

1 June 2014
Verified
Conference Paper
Open access
XLXiaodong Lan
Xiaodong Lan
MSMac Schwager
Mac Schwager
This paper considers the problem of planning a trajectory for a sensing robot to best estimate a time-changing scalar field in its environment. We model the field as a linear combination of basis functions with time-varying weights. The robot uses a Kalman-like filter to maintain an estimate of the field, and to compute the error covariance of the estimate. The goal is to find a trajectory for the sensing robot that minimizes a cost metric on the error covariance and the control effort expended by the robot. Pontryagin's Minimum Principle is used to find a set of differential equations that must be satisfied by the optimal trajectory. A numerical solver is used to find a trajectory satisfying these equations to give persistent monitoring trajectories.

24 April 2024 in Drones
Verified
Journal Article
Open access
PDF file
PRPrabhash Ragbir
Prabhash Ragbir
Ajith KaduwelaAjith Kaduwela
Ajith Kaduwela
XLXiaodong Lan
Xiaodong Lan
AWAdam C. Watts
Adam C. Watts
Zhaodan KongZhaodan Kong
Zhaodan Kong
Wildfires have the potential to cause severe damage to vegetation, property and most importantly, human life. In order to minimize these negative impacts, it is crucial that wildfires are detected at the earliest possible stages. A potential solution for early wildfire detection is to utilize unmanned aerial vehicles (UAVs) that are capable of tracking the chemical concentration gradient of smoke emitted by wildfires. A spatiotemporal model of wildfire smoke plume dynamics can allow for efficient tracking of the chemicals by utilizing both real-time information from sensors as well as future information from the model predictions. This study investigates a spatiotemporal modeling approach based on subspace identification (SID) to develop a data-driven smoke plume dynamics model for the purposes of early wildfire detection. The model was learned using CO2 concentration data which were collected using an air quality sensor package onboard a UAV during two prescribed burn experiments. Our model was evaluated by comparing the predicted values to the measured values at random locations and showed mean errors of 6.782 ppm and 30.01 ppm from the two experiments. Additionally, our model was shown to outperform the commonly used Gaussian puff model (GPM) which showed mean errors of 25.799 ppm and 104.492 ppm, respectively.