Yujia Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yujia Li has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Yuhua Cong
College of Automation Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China
3 shared publications - Zhisheng Wang
College of Automation Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China
3 shared publications - Xian Zhu
College of Computer and Artificial Intelligence, Nanjing University of Science and Technology Zijin College, Nanjing 210023, China
2 shared publications - Haoyi Liu
College of Automation Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 211100, China
1 shared publication - Huijuan Zhu
College of Computer and Artificial Intelligence, Nanjing University of Science and Technology Zijin College, Nanjing 210023, China
1 shared publication - Lianghui Huang
School of Automation and Electrical Engineering, Zhejiang University of Science and Technology, Hangzhou 310023, China
1 shared publication
Latest Publications
- Open Access
Risk-Bounded Certificate Feedback for Allocation-Guided Cooperative Path Planning of Dynamic Multi-UAV Missions
This paper addresses low-altitude navigation of multiple UAVs through a shared two-dimensional environment with narrow passages, blocked cells, and predicted moving obstacles while preserving an assigned task order. The planner receives ordered task bundles from an allocator and checks static obstacles, moving-obstacle timing, sampled minimum inter-UAV separation, deadlines, risk budgets, and an energy proxy. It generates risk-weighted candidate path segments, repairs timing conflicts with waits and local detours, verifies service and terminal occupancy, and returns a certificate that records whether a segment is executable, its total travel cost, risk exposure, and energy proxy, or the reason for failure. We compare no feedback, context no-good, typed-failure, quantitative, and combined feedback under medium-load and high-stress test suites. Quantitative feedback lowers risk per completed task in both suites after correction for multiple comparisons. Failure-type feedback adds no detectable benefit, and completion-rate differences do not remain significant after the same correction. Fixed-bundle simulations show that the proposed planner can preserve scheduled executability while reducing threat exposure relative to a spatiotemporal-priority baseline. Single-UAV flights demonstrate waypoint execution, reference tracking, and avoidance of designated regions.
Open AccessRisk-Bounded Certificate Feedback for Allocation-Guided Cooperative Path Planning of Dynamic Multi-UAV Missions
This paper addresses low-altitude navigation of multiple UAVs through a shared two-dimensional environment with narrow passages, blocked cells, and predicted moving obstacles while preserving an assigned task order. The planner receives ordered task bundles from an allocator and checks static obstacles, moving-obstacle timing, sampled minimum inter-UAV separation, deadlines, risk budgets, and an energy proxy. It generates risk-weighted candidate path segments, repairs timing conflicts with waits and local detours, verifies service and terminal occupancy, and returns a certificate that records whether a segment is executable, its total travel cost, risk exposure, and energy proxy, or the reason for failure. We compare no feedback, context no-good, typed-failure, quantitative, and combined feedback under medium-load and high-stress test suites. Quantitative feedback lowers risk per completed task in both suites after correction for multiple comparisons. Failure-type feedback adds no detectable benefit, and completion-rate differences do not remain significant after the same correction. Fixed-bundle simulations show that the proposed planner can preserve scheduled executability while reducing threat exposure relative to a spatiotemporal-priority baseline. Single-UAV flights demonstrate waypoint execution, reference tracking, and avoidance of designated regions.
- Open Access
An Event-Triggered Path-Based Bid Assignment Method for Energy-Aware Dynamic Multi-UAV Task Allocation
This study addresses dynamic multi-UAV task allocation under online task release, static obstacles, deadlines, limited energy, and vehicle failures. We propose an event-triggered path-based bid assignment method (ET-PBBA). At each mission event, an A-star module estimates the static-obstacle travel cost of feasible UAV–task pairs, while a normalized score combines reward, path length, predicted energy, and secondary load–energy pressure. A one-pass sorted scan then produces an event-local one-to-one assignment. Paired-seed mechanism tests show that event-time activation raises completion rate by 0.046 in the main scenario and 0.065 under failure stress relative to 10 s periodic allocation. The path-dependent physical-cost block provides the dominant improvement over reward-only ranking, whereas the balance term is not significant in the ordinary scenarios. For 10 UAVs and 50 tasks, ET-PBBA reduces average completion time by 5.2% and 4.1% and total energy by 4.3% and 3.0% relative to auction and CBBA, respectively, although Hungarian remains the stronger centralized reference. Under failure stress, completion reaches 0.790 and deadline violations decrease to 9.73. Single-UAV replay completes all 50 nominal waypoints with 9.16 cm mean error, providing auxiliary tracking evidence rather than validation of nonlinear or online multi-UAV execution.
Open AccessAn Event-Triggered Path-Based Bid Assignment Method for Energy-Aware Dynamic Multi-UAV Task Allocation
This study addresses dynamic multi-UAV task allocation under online task release, static obstacles, deadlines, limited energy, and vehicle failures. We propose an event-triggered path-based bid assignment method (ET-PBBA). At each mission event, an A-star module estimates the static-obstacle travel cost of feasible UAV–task pairs, while a normalized score combines reward, path length, predicted energy, and secondary load–energy pressure. A one-pass sorted scan then produces an event-local one-to-one assignment. Paired-seed mechanism tests show that event-time activation raises completion rate by 0.046 in the main scenario and 0.065 under failure stress relative to 10 s periodic allocation. The path-dependent physical-cost block provides the dominant improvement over reward-only ranking, whereas the balance term is not significant in the ordinary scenarios. For 10 UAVs and 50 tasks, ET-PBBA reduces average completion time by 5.2% and 4.1% and total energy by 4.3% and 3.0% relative to auction and CBBA, respectively, although Hungarian remains the stronger centralized reference. Under failure stress, completion reaches 0.790 and deadline violations decrease to 9.73. Single-UAV replay completes all 50 nominal waypoints with 9.16 cm mean error, providing auxiliary tracking evidence rather than validation of nonlinear or online multi-UAV execution.
- Open Access
Certificate-Guided Safe Tracking Control for Allocation-Guided Multi-UAV Missions
Hierarchical multi-UAV planning can produce scheduled paths that become unsafe during execution because tracking dynamics, actuator limits, sampling, and communication are not fully represented upstream. We introduce a certificate-guided safe-tracking framework that treats each planned path as a versioned execution contract with explicit tube, separation, timing, uncertainty, communication, and input bounds. A rigid-body-derived translational interface supports a command-producing control Lyapunov function–control barrier function quadratic program with hard safety constraints. When a candidate becomes infeasible, a separate minimum-slack program localizes the conflict without passing its command to the plant, and an explicit repair map converts the resulting witness into timing or vertical-spacing updates, with escalation when local repair fails. Randomized comparisons show that certificate feedback removes the observed tube and separation failures of a plain CBF-QP while maintaining reliable completion and competitive tracking relative to a tracking-error-bound comparator. Disturbance and sensor-noise sweeps characterize robustness, and separate indoor flights confirm single-reference trackability. The framework therefore turns execution infeasibility into actionable planning feedback rather than a terminal controller failure.
Open AccessCertificate-Guided Safe Tracking Control for Allocation-Guided Multi-UAV Missions
Hierarchical multi-UAV planning can produce scheduled paths that become unsafe during execution because tracking dynamics, actuator limits, sampling, and communication are not fully represented upstream. We introduce a certificate-guided safe-tracking framework that treats each planned path as a versioned execution contract with explicit tube, separation, timing, uncertainty, communication, and input bounds. A rigid-body-derived translational interface supports a command-producing control Lyapunov function–control barrier function quadratic program with hard safety constraints. When a candidate becomes infeasible, a separate minimum-slack program localizes the conflict without passing its command to the plant, and an explicit repair map converts the resulting witness into timing or vertical-spacing updates, with escalation when local repair fails. Randomized comparisons show that certificate feedback removes the observed tube and separation failures of a plain CBF-QP while maintaining reliable completion and competitive tracking relative to a tracking-error-bound comparator. Disturbance and sensor-noise sweeps characterize robustness, and separate indoor flights confirm single-reference trackability. The framework therefore turns execution infeasibility into actionable planning feedback rather than a terminal controller failure.
- Open Access
User-Demand-Oriented Healthy Charging Control Strategy for EVs Based on Football Team Training Algorithm
With the rapid development of the electric vehicle (EV) market, effective charging control is essential for enhancing user experience and preserving battery health. Across various scenarios, this work proposes a user-demand-oriented healthy charging control strategy that balances charging efficiency and battery lifespan using the football team training algorithm (FTTA). Firstly, an enhanced hybrid stacking–boosting ensemble (EHSBE) model is designed to predict user charging duration through different feature selections and a hybrid framework. Secondly, a healthy charging control strategy based on the FTTA is developed. This strategy addresses a multi-objective optimization problem, considering two charging objectives: completing the charging task and reducing energy loss, as well as three safety-related constraints. The algorithm achieves a healthy strategy through interaction and iterative refinement among potential solutions. Simulation and experimental results show that the proposed strategy significantly reduces energy loss, generating only 5.8% and 24% of the energy loss generated by the fast charging approach under two different durations. With user expectations and maintenance of battery health, the charging process is optimized so that battery life is extended by 25.7% and user demand is satisfied.
Open AccessUser-Demand-Oriented Healthy Charging Control Strategy for EVs Based on Football Team Training Algorithm
With the rapid development of the electric vehicle (EV) market, effective charging control is essential for enhancing user experience and preserving battery health. Across various scenarios, this work proposes a user-demand-oriented healthy charging control strategy that balances charging efficiency and battery lifespan using the football team training algorithm (FTTA). Firstly, an enhanced hybrid stacking–boosting ensemble (EHSBE) model is designed to predict user charging duration through different feature selections and a hybrid framework. Secondly, a healthy charging control strategy based on the FTTA is developed. This strategy addresses a multi-objective optimization problem, considering two charging objectives: completing the charging task and reducing energy loss, as well as three safety-related constraints. The algorithm achieves a healthy strategy through interaction and iterative refinement among potential solutions. Simulation and experimental results show that the proposed strategy significantly reduces energy loss, generating only 5.8% and 24% of the energy loss generated by the fast charging approach under two different durations. With user expectations and maintenance of battery health, the charging process is optimized so that battery life is extended by 25.7% and user demand is satisfied.