Kooktae Lee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Kooktae Lee has a total of 61 co-authors. Here are the top co-authors by number of shared publications:
Raktim Bhattacharya
Department of Aerospace Engineering, Texas A&M University, College Station, TX, 77843, USA
10 shared publications- Sungjun Seo
Department of Mechanical Engineering, New Mexico Institute of Mining and Technology, Socorro, NM, USA
7 shared publications Abhishek Halder
Department of Electrical and Computer Engineering, Texas A&M University, College Station, Texas 77843-3141
5 shared publicationsWoojin Chung
5 shared publications- Rabiul Hasan Kabir
Rutgers University
4 shared publications - Raktim Bhattacharya
Aerospace Engineering Texas A&M University College Station 77843-3141. TX
3 shared publications
Latest Publications
- 25 July 2026
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 181
AI-augmented Density-Driven Optimal Control for decentralized environmental mapping
- 25 July 2026
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 181
AI-augmented Density-Driven Optimal Control for decentralized environmental mapping
- 1 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control Systems Technology
- Vol. 34  (2) , 711-724
Density-Driven Multidrone Coordination for Efficient Farm Coverage and Management in Smart Agriculture
The growing scale of modern farms has led to an increased demand for efficient and adaptive strategies for pest, weed, and disease management. Traditional methods, such as manual inspections and blanket pesticide spraying, often result in excessive chemical use, resource wastage, and environmental degradation. Uncrewed aerial vehicles (UAVs) have emerged as a promising solution for precision agriculture, offering the potential for targeted spraying that enhances operational efficiency. However, existing UAV-based approaches face limitations, including restricted battery life, small payload capacity, and inefficient large-area coverage, particularly when relying on single-UAV systems. Multi-UAV coordination strategies have been proposed to address these challenges, yet many of these frameworks still rely on uniform spraying, neglecting important factors such as infestation severity, UAV dynamics, and energy efficiency. This article introduces a density-driven optimal control (D2OC) framework, leveraging optimal transport (OT) theory to optimize UAV-based pesticide spraying in large-scale agricultural environments. The proposed method facilitates adaptive resource allocation based on infestation severity, reducing unnecessary chemical application. UAVs are modeled as a linear time-varying (LTV) system, accounting for variations in mass and moment of inertia due to payload changes. The D2OC-based control strategy, derived through Lagrangian mechanics, ensures efficient fleet coordination, balanced workload distribution, and optimized mission duration. Simulation results demonstrate that the proposed approach outperforms traditional methods, such as uniform coverage and spectral multiscale coverage (SMC), in terms of coverage efficiency, chemical reduction, and sustainability, providing a scalable and resource-efficient solution for smart farming.
- 1 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control Systems Technology
- Vol. 34  (2) , 711-724
Density-Driven Multidrone Coordination for Efficient Farm Coverage and Management in Smart Agriculture
The growing scale of modern farms has led to an increased demand for efficient and adaptive strategies for pest, weed, and disease management. Traditional methods, such as manual inspections and blanket pesticide spraying, often result in excessive chemical use, resource wastage, and environmental degradation. Uncrewed aerial vehicles (UAVs) have emerged as a promising solution for precision agriculture, offering the potential for targeted spraying that enhances operational efficiency. However, existing UAV-based approaches face limitations, including restricted battery life, small payload capacity, and inefficient large-area coverage, particularly when relying on single-UAV systems. Multi-UAV coordination strategies have been proposed to address these challenges, yet many of these frameworks still rely on uniform spraying, neglecting important factors such as infestation severity, UAV dynamics, and energy efficiency. This article introduces a density-driven optimal control (D2OC) framework, leveraging optimal transport (OT) theory to optimize UAV-based pesticide spraying in large-scale agricultural environments. The proposed method facilitates adaptive resource allocation based on infestation severity, reducing unnecessary chemical application. UAVs are modeled as a linear time-varying (LTV) system, accounting for variations in mass and moment of inertia due to payload changes. The D2OC-based control strategy, derived through Lagrangian mechanics, ensures efficient fleet coordination, balanced workload distribution, and optimized mission duration. Simulation results demonstrate that the proposed approach outperforms traditional methods, such as uniform coverage and spectral multiscale coverage (SMC), in terms of coverage efficiency, chemical reduction, and sustainability, providing a scalable and resource-efficient solution for smart farming.
- Open Access
AI-Augmented Density-Driven Optimal Control (D2OC) for Decentralized Environmental Mapping
This paper presents an AI-augmented decentralized framework for multi-agent (multi-robot) environmental mapping under limited sensing and communication. While conventional coverage formulations achieve effective spatial allocation when an accurate reference map is available, their performance deteriorates under uncertain or biased priors. The proposed method introduces an adaptive and self-correcting mechanism that enables agents to iteratively refine local density estimates within an optimal transport-based framework, ensuring theoretical consistency and scalability. A dual multilayer perceptron (MLP) module enhances adaptivity by inferring local mean-variance statistics and regulating virtual uncertainty for long-unvisited regions, mitigating stagnation around local minima. Theoretical analysis rigorously proves convergence under the Wasserstein metric, while simulation results demonstrate that the proposed AI-augmented Density-Driven Optimal Control consistently achieves robust and precise alignment with the ground-truth density, yielding substantially higher-fidelity reconstruction of complex multi-modal spatial distributions compared with conventional decentralized baselines.
Open AccessAI-Augmented Density-Driven Optimal Control (D2OC) for Decentralized Environmental Mapping
This paper presents an AI-augmented decentralized framework for multi-agent (multi-robot) environmental mapping under limited sensing and communication. While conventional coverage formulations achieve effective spatial allocation when an accurate reference map is available, their performance deteriorates under uncertain or biased priors. The proposed method introduces an adaptive and self-correcting mechanism that enables agents to iteratively refine local density estimates within an optimal transport-based framework, ensuring theoretical consistency and scalability. A dual multilayer perceptron (MLP) module enhances adaptivity by inferring local mean-variance statistics and regulating virtual uncertainty for long-unvisited regions, mitigating stagnation around local minima. Theoretical analysis rigorously proves convergence under the Wasserstein metric, while simulation results demonstrate that the proposed AI-augmented Density-Driven Optimal Control consistently achieves robust and precise alignment with the ground-truth density, yielding substantially higher-fidelity reconstruction of complex multi-modal spatial distributions compared with conventional decentralized baselines.
- 7 January 2026
- Published by ASME International in Journal of Dynamic Systems, Measurement, and Control
- Vol. 148  (2)
On the Convergence of Density-Based Predictive Control for Multi-Agent Non-Uniform Area Coverage
This paper investigates the convergence conditions of Density-based Predictive Control (DPC) for nonuniform area coverage. In large-scale real-world scenarios, such as search and rescue (SAR) or environmental monitoring missions, efficient nonuniform multi-agent area coverage is essential, as uniform coverage fails to account for varying regional priorities and operational constraints. To address this, we propose a novel multi-agent density-based predictive control strategy, DPC, grounded in optimal transport (OT) theory. Given a preconstructed reference distribution representing priority regions, DPC ensures that agents allocate their coverage efforts by spending more time in high-priority or densely sampled areas, achieving effective nonuniform coverage. We analyze the convergence conditions of DPC by formulating the contraction mapping problem in terms of the Wasserstein distance. Additionally, we derive the analytic optimal control law for the unconstrained case and propose a numerical optimization method for determining the optimal control law under input constraints. Comprehensive simulations were conducted on both first-order dynamic systems and a linearized quadrotor model under constrained and unconstrained conditions. The results demonstrate that when the proposed conditions are satisfied, the Wasserstein distance locally converges, and the agent trajectories closely match the nonuniform reference distribution. Furthermore, the comparison with the existing coverage method demonstrated the superiority of the DPC method in nonuniform area coverage.
- 7 January 2026
- Published by ASME International in Journal of Dynamic Systems, Measurement, and Control
- Vol. 148  (2)
On the Convergence of Density-Based Predictive Control for Multi-Agent Non-Uniform Area Coverage
This paper investigates the convergence conditions of Density-based Predictive Control (DPC) for nonuniform area coverage. In large-scale real-world scenarios, such as search and rescue (SAR) or environmental monitoring missions, efficient nonuniform multi-agent area coverage is essential, as uniform coverage fails to account for varying regional priorities and operational constraints. To address this, we propose a novel multi-agent density-based predictive control strategy, DPC, grounded in optimal transport (OT) theory. Given a preconstructed reference distribution representing priority regions, DPC ensures that agents allocate their coverage efforts by spending more time in high-priority or densely sampled areas, achieving effective nonuniform coverage. We analyze the convergence conditions of DPC by formulating the contraction mapping problem in terms of the Wasserstein distance. Additionally, we derive the analytic optimal control law for the unconstrained case and propose a numerical optimization method for determining the optimal control law under input constraints. Comprehensive simulations were conducted on both first-order dynamic systems and a linearized quadrotor model under constrained and unconstrained conditions. The results demonstrate that when the proposed conditions are satisfied, the Wasserstein distance locally converges, and the agent trajectories closely match the nonuniform reference distribution. Furthermore, the comparison with the existing coverage method demonstrated the superiority of the DPC method in nonuniform area coverage.
- Open Access
Breaking Symmetry-Induced Degeneracy in Multi-Agent Ergodic Coverage via Stochastic Spectral Control
Multi-agent ergodic coverage via Spectral Multiscale Coverage (SMC) provides a principled framework for driving a team of agents so that their collective time-averaged trajectories match a prescribed spatial distribution. While classical SMC has demonstrated empirical success, it can suffer from gradient cancellation, particularly when agents are initialized near symmetry points of the target distribution, leading to undesirable behaviors such as stalling or motion constrained along symmetry axes. In this work, we rigorously characterize the initial conditions and symmetry-induced invariant manifolds that give rise to such directional degeneracy in first-order agent dynamics. To address this, we introduce a stochastic perturbation combined with a contraction term and prove that the resulting dynamics ensure almost-sure escape from zero-gradient manifolds while maintaining mean-square boundedness of agent trajectories. Simulations on symmetric multi-modal reference distributions demonstrate that the proposed stochastic SMC effectively mitigates transient stalling and axis-constrained motion, while ensuring that all agent trajectories remain bounded within the domain.
Open AccessBreaking Symmetry-Induced Degeneracy in Multi-Agent Ergodic Coverage via Stochastic Spectral Control
Multi-agent ergodic coverage via Spectral Multiscale Coverage (SMC) provides a principled framework for driving a team of agents so that their collective time-averaged trajectories match a prescribed spatial distribution. While classical SMC has demonstrated empirical success, it can suffer from gradient cancellation, particularly when agents are initialized near symmetry points of the target distribution, leading to undesirable behaviors such as stalling or motion constrained along symmetry axes. In this work, we rigorously characterize the initial conditions and symmetry-induced invariant manifolds that give rise to such directional degeneracy in first-order agent dynamics. To address this, we introduce a stochastic perturbation combined with a contraction term and prove that the resulting dynamics ensure almost-sure escape from zero-gradient manifolds while maintaining mean-square boundedness of agent trajectories. Simulations on symmetric multi-modal reference distributions demonstrate that the proposed stochastic SMC effectively mitigates transient stalling and axis-constrained motion, while ensuring that all agent trajectories remain bounded within the domain.
- 29 December 2025
- Published by ASME International in Journal of Dynamic Systems, Measurement, and Control
- Vol. 148  (3)
An Optimal Transport-Based Undersampling Technique for Handling Imbalanced Datasets
This paper investigates a novel undersampling technique based on optimal transport (OT) for managing imbalanced datasets in classification tasks. Undersampling is crucial for reducing dataset size while preserving essential statistical properties, improving both classification performance and computational efficiency. Existing methods, such as random undersampling, NearMiss, Tomek Links, and Edited Nearest Neighbor, often fail to adequately preserve the underlying data distribution. To address this limitation, we propose a Wasserstein distance-based undersampling method that formulates an optimization problem aimed at minimizing distributional distortion. By leveraging the Wasserstein distance to quantify differences between probability distributions, the proposed approach ensures that the reduced dataset retains key geometric and statistical characteristics of the original majority class. Furthermore, we provide a computational complexity analysis and establish a stability property that bounds the Wasserstein deviation introduced by support reduction. Simulation results on synthetically generated imbalanced datasets demonstrate that the proposed method preserves the structural characteristics of the original data more effectively than existing resampling techniques, while achieving balanced classification performance across both majority and minority classes. These results highlight the potential of the proposed approach as an effective and scalable solution for addressing class imbalance in practical classification problems.
- 29 December 2025
- Published by ASME International in Journal of Dynamic Systems, Measurement, and Control
- Vol. 148  (3)
An Optimal Transport-Based Undersampling Technique for Handling Imbalanced Datasets
This paper investigates a novel undersampling technique based on optimal transport (OT) for managing imbalanced datasets in classification tasks. Undersampling is crucial for reducing dataset size while preserving essential statistical properties, improving both classification performance and computational efficiency. Existing methods, such as random undersampling, NearMiss, Tomek Links, and Edited Nearest Neighbor, often fail to adequately preserve the underlying data distribution. To address this limitation, we propose a Wasserstein distance-based undersampling method that formulates an optimization problem aimed at minimizing distributional distortion. By leveraging the Wasserstein distance to quantify differences between probability distributions, the proposed approach ensures that the reduced dataset retains key geometric and statistical characteristics of the original majority class. Furthermore, we provide a computational complexity analysis and establish a stability property that bounds the Wasserstein deviation introduced by support reduction. Simulation results on synthetically generated imbalanced datasets demonstrate that the proposed method preserves the structural characteristics of the original data more effectively than existing resampling techniques, while achieving balanced classification performance across both majority and minority classes. These results highlight the potential of the proposed approach as an effective and scalable solution for addressing class imbalance in practical classification problems.
- Open Access
Collision-Aware Density-Driven Control of Multi-Agent Systems via Control Barrier Functions
This paper tackles the problem of safe and efficient area coverage using a multi-agent system operating in environments with obstacles. Applications such as environmental monitoring and search and rescue require robot swarms to cover large domains under resource constraints, making both coverage efficiency and safety essential. To address the efficiency aspect, we adopt the Density-Driven Control (D$^2$C) framework, which uses optimal transport theory to steer agents according to a reference distribution that encodes spatial coverage priorities. To ensure safety, we incorporate Control Barrier Functions (CBFs) into the framework. While CBFs are commonly used for collision avoidance, we extend their applicability by introducing obstacle-specific formulations for both circular and rectangular shapes. In particular, we analytically derive a unit normal vector based on the agent's position relative to the nearest face of a rectangular obstacle, improving safety enforcement in environments with non-smooth boundaries. Additionally, a velocity-dependent term is incorporated into the CBF to enhance collision avoidance. Simulation results validate the proposed method by demonstrating smoother navigation near obstacles and more efficient area coverage than the existing method, while still ensuring collision-free operation.
Open AccessCollision-Aware Density-Driven Control of Multi-Agent Systems via Control Barrier Functions
This paper tackles the problem of safe and efficient area coverage using a multi-agent system operating in environments with obstacles. Applications such as environmental monitoring and search and rescue require robot swarms to cover large domains under resource constraints, making both coverage efficiency and safety essential. To address the efficiency aspect, we adopt the Density-Driven Control (D$^2$C) framework, which uses optimal transport theory to steer agents according to a reference distribution that encodes spatial coverage priorities. To ensure safety, we incorporate Control Barrier Functions (CBFs) into the framework. While CBFs are commonly used for collision avoidance, we extend their applicability by introducing obstacle-specific formulations for both circular and rectangular shapes. In particular, we analytically derive a unit normal vector based on the agent's position relative to the nearest face of a rectangular obstacle, improving safety enforcement in environments with non-smooth boundaries. Additionally, a velocity-dependent term is incorporated into the CBF to enhance collision avoidance. Simulation results validate the proposed method by demonstrating smoother navigation near obstacles and more efficient area coverage than the existing method, while still ensuring collision-free operation.
- 5 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2723-2728
Connectivity-Preserving Multi-Agent Area Coverage via Density-Driven Optimal Control (D²OC)
Multi-agent systems are widely used for area coverage tasks in applications such as search-and-rescue, environmental monitoring, and precision agriculture. Achieving non-uniform coverage, where certain regions are prioritized, requires coordinating agents while accounting for dynamic and communication constraints. Existing density-driven methods effectively distribute agents according to a reference density but typically do not guarantee connectivity, which can lead to disconnected agents and degraded coverage in practical deployments. This letter presents a connectivity-preserving approach within the Density-Driven Optimal Control (DOC) framework. The coverage problem, expressed via the Wasserstein distance between agent distributions and a reference density, is formulated as a quadratic program. Communication constraints are incorporated through a smooth penalty function, ensuring strict convexity and global optimality while naturally maintaining inter-agent connectivity without rigid formations. Simulation results demonstrate that the proposed method effectively keeps agents within communication range, improving coverage quality and convergence speed compared to methods without explicit connectivity enforcement.
- 5 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 2723-2728
Connectivity-Preserving Multi-Agent Area Coverage via Density-Driven Optimal Control (D²OC)
Multi-agent systems are widely used for area coverage tasks in applications such as search-and-rescue, environmental monitoring, and precision agriculture. Achieving non-uniform coverage, where certain regions are prioritized, requires coordinating agents while accounting for dynamic and communication constraints. Existing density-driven methods effectively distribute agents according to a reference density but typically do not guarantee connectivity, which can lead to disconnected agents and degraded coverage in practical deployments. This letter presents a connectivity-preserving approach within the Density-Driven Optimal Control (DOC) framework. The coverage problem, expressed via the Wasserstein distance between agent distributions and a reference density, is formulated as a quadratic program. Communication constraints are incorporated through a smooth penalty function, ensuring strict convexity and global optimality while naturally maintaining inter-agent connectivity without rigid formations. Simulation results demonstrate that the proposed method effectively keeps agents within communication range, improving coverage quality and convergence speed compared to methods without explicit connectivity enforcement.
- Open Access
On the Convergence of Density-Based Predictive Control for Multi-Agent Non-Uniform Area Coverage
This paper presents Density-based Predictive Control (DPC), a novel multi-agent control strategy for efficient non-uniform area coverage, grounded in optimal transport theory. In large-scale scenarios such as search and rescue or environmental monitoring, traditional uniform coverage fails to account for varying regional priorities. DPC leverages a pre-constructed reference distribution to allocate agents' coverage efforts, spending more time in high-priority or densely sampled regions. We analyze convergence conditions using the Wasserstein distance, derive an analytic optimal control law for unconstrained cases, and propose a numerical method for constrained scenarios. Simulations on first-order dynamics and linearized quadrotor models demonstrate that DPC achieves trajectories closely matching the non-uniform reference distribution, outperforming existing coverage methods.
Open AccessOn the Convergence of Density-Based Predictive Control for Multi-Agent Non-Uniform Area Coverage
This paper presents Density-based Predictive Control (DPC), a novel multi-agent control strategy for efficient non-uniform area coverage, grounded in optimal transport theory. In large-scale scenarios such as search and rescue or environmental monitoring, traditional uniform coverage fails to account for varying regional priorities. DPC leverages a pre-constructed reference distribution to allocate agents' coverage efforts, spending more time in high-priority or densely sampled regions. We analyze convergence conditions using the Wasserstein distance, derive an analytic optimal control law for unconstrained cases, and propose a numerical method for constrained scenarios. Simulations on first-order dynamics and linearized quadrotor models demonstrate that DPC achieves trajectories closely matching the non-uniform reference distribution, outperforming existing coverage methods.
- Open Access
Density-Driven Multi-Agent Coordination for Efficient Farm Coverage and Management in Smart Agriculture
The growing scale of modern farms has increased the need for efficient and adaptive multi-agent coverage strategies for pest, weed, and disease management. Traditional methods such as manual inspection and blanket pesticide spraying often lead to excessive chemical use, resource waste, and environmental impact. While unmanned aerial vehicles (UAVs) offer a promising platform for precision agriculture through targeted spraying and improved operational efficiency, existing UAV-based approaches remain limited by battery life, payload capacity, and scalability, especially in large fields where single-UAV or uniformly distributed spraying is insufficient. Although multi-UAV coordination has been explored, many current frameworks still assume uniform spraying and do not account for infestation severity, UAV dynamics, non-uniform resource allocation, or energy-efficient coordination. To address these limitations, this paper proposes a Density-Driven Optimal Control (D2OC) framework that integrates Optimal Transport (OT) theory with multi-UAV coverage control for large-scale agricultural spraying. The method supports non-uniform, priority-aware resource allocation based on infestation intensity, reducing unnecessary chemical application. UAVs are modeled as a linear time-varying (LTV) system to capture variations in mass and inertia during spraying missions. The D2OC control law, derived using Lagrangian mechanics, enables efficient coordination, balanced workload distribution, and improved mission duration. Simulation results demonstrate that the proposed approach outperforms uniform spraying and Spectral Multiscale Coverage (SMC) in coverage efficiency, chemical reduction, and operational sustainability, providing a scalable solution for smart agriculture.
Open AccessDensity-Driven Multi-Agent Coordination for Efficient Farm Coverage and Management in Smart Agriculture
The growing scale of modern farms has increased the need for efficient and adaptive multi-agent coverage strategies for pest, weed, and disease management. Traditional methods such as manual inspection and blanket pesticide spraying often lead to excessive chemical use, resource waste, and environmental impact. While unmanned aerial vehicles (UAVs) offer a promising platform for precision agriculture through targeted spraying and improved operational efficiency, existing UAV-based approaches remain limited by battery life, payload capacity, and scalability, especially in large fields where single-UAV or uniformly distributed spraying is insufficient. Although multi-UAV coordination has been explored, many current frameworks still assume uniform spraying and do not account for infestation severity, UAV dynamics, non-uniform resource allocation, or energy-efficient coordination. To address these limitations, this paper proposes a Density-Driven Optimal Control (D2OC) framework that integrates Optimal Transport (OT) theory with multi-UAV coverage control for large-scale agricultural spraying. The method supports non-uniform, priority-aware resource allocation based on infestation intensity, reducing unnecessary chemical application. UAVs are modeled as a linear time-varying (LTV) system to capture variations in mass and inertia during spraying missions. The D2OC control law, derived using Lagrangian mechanics, enables efficient coordination, balanced workload distribution, and improved mission duration. Simulation results demonstrate that the proposed approach outperforms uniform spraying and Spectral Multiscale Coverage (SMC) in coverage efficiency, chemical reduction, and operational sustainability, providing a scalable solution for smart agriculture.