Qiuchen Qian
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Qiuchen Qian has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- David Boyle
Systems and Algorithms Laboratory, Imperial College London, London, U.K.
4 shared publications - Yanran Wang
Dyson School of Design Engineering, Imperial College London, London, U.K.
2 shared publications - Akshayaa Y. S. Pandiyan
Department of Electrical and Electronic Engineering, Imperial College London, London, U.K.
1 shared publication - James O'KEeffe
Department of Computer Science, University of York
1 shared publication - Yanran Wang
Institute of Medical Devices, Guangdong Food and Drug Vocational College, China
1 shared publication
Latest Publications
- 3 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (10) , 13988-14001
Adaptive Probabilistic Planning for the Uncertain and Dynamic Orienteering Problem
The orienteering problem (OP) is a well-studied routing problem that has been extended to incorporate uncertainties, reflecting stochastic or dynamic travel costs, prize-collection costs, and prizes. Existing approaches may, however, be inefficient in real-world applications due to insufficient modeling knowledge and initially unknowable parameters in online scenarios. Thus, we propose the uncertain and dynamic OP (UDOP), modeling travel costs as distributions with unknown and time-variant parameters. UDOP also associates uncertain travel costs with dynamic prizes and prize-collection costs for its objective and budget constraints. To address UDOP, we develop an Adaptive Approach for Probabilistic paths (ADAPT), iteratively performing “execution” and “online planning” based on an initial “offline” solution. The execution phase updates the system status and records online cost observations. The online planner employs a Bayesian approach to adaptively estimate power consumption and optimize path sequence based on safety beliefs. We evaluate ADAPT in a practical autonomous aerial vehicle charging scheduling problem (CSP) for wireless rechargeable sensor networks (WRSNs). The UAV must optimize its path to recharge sensor nodes efficiently while managing its energy under uncertain conditions. ADAPT maintains comparable solution quality and computation time while offering superior robustness. Extensive simulations show that ADAPT achieves a 100% mission success rate (MSR) across all tested scenarios, outperforming comparable heuristic-based and frequentist approaches that fail up to 70% (under challenging conditions) and averaging 67% MSR, respectively. This work advances the field of OP with uncertainties, offering a reliable and efficient approach for real-world applications in uncertain and dynamic environments.
- 3 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (10) , 13988-14001
Adaptive Probabilistic Planning for the Uncertain and Dynamic Orienteering Problem
The orienteering problem (OP) is a well-studied routing problem that has been extended to incorporate uncertainties, reflecting stochastic or dynamic travel costs, prize-collection costs, and prizes. Existing approaches may, however, be inefficient in real-world applications due to insufficient modeling knowledge and initially unknowable parameters in online scenarios. Thus, we propose the uncertain and dynamic OP (UDOP), modeling travel costs as distributions with unknown and time-variant parameters. UDOP also associates uncertain travel costs with dynamic prizes and prize-collection costs for its objective and budget constraints. To address UDOP, we develop an Adaptive Approach for Probabilistic paths (ADAPT), iteratively performing “execution” and “online planning” based on an initial “offline” solution. The execution phase updates the system status and records online cost observations. The online planner employs a Bayesian approach to adaptively estimate power consumption and optimize path sequence based on safety beliefs. We evaluate ADAPT in a practical autonomous aerial vehicle charging scheduling problem (CSP) for wireless rechargeable sensor networks (WRSNs). The UAV must optimize its path to recharge sensor nodes efficiently while managing its energy under uncertain conditions. ADAPT maintains comparable solution quality and computation time while offering superior robustness. Extensive simulations show that ADAPT achieves a 100% mission success rate (MSR) across all tested scenarios, outperforming comparable heuristic-based and frequentist approaches that fail up to 70% (under challenging conditions) and averaging 67% MSR, respectively. This work advances the field of OP with uncertainties, offering a reliable and efficient approach for real-world applications in uncertain and dynamic environments.
- Open Access
- 17 May 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 318 (2) , 369-387
On solving close enough orienteering problems with overlapped neighborhoods
- 17 May 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 318 (2) , 369-387
Open AccessOn solving close enough orienteering problems with overlapped neighborhoods
- Open Access
QuaDUE-CCM: Interpretable Distributional Reinforcement Learning using Uncertain Contraction Metrics for Precise Quadrotor Trajectory Tracking
Accuracy and stability are common requirements for Quadrotor trajectory tracking systems. Designing an accurate and stable tracking controller remains challenging, particularly in unknown and dynamic environments with complex aerodynamic disturbances. We propose a Quantile-approximation-based Distributional-reinforced Uncertainty Estimator (QuaDUE) to accurately identify the effects of aerodynamic disturbances, i.e., the uncertainties between the true and estimated Control Contraction Metrics (CCMs). Taking inspiration from contraction theory and integrating the QuaDUE for uncertainties, our novel CCM-based trajectory tracking framework tracks any feasible reference trajectory precisely whilst guaranteeing exponential convergence. More importantly, the convergence and training acceleration of the distributional RL are guaranteed and analyzed, respectively, from theoretical perspectives. We also demonstrate our system under unknown and diverse aerodynamic forces. Under large aerodynamic forces (>2m/s^2), compared with the classic data-driven approach, our QuaDUE-CCM achieves at least a 56.6% improvement in tracking error. Compared with QuaDRED-MPC, a distributional RL-based approach, QuaDUE-CCM achieves at least a 3 times improvement in contraction rate.
Open AccessQuaDUE-CCM: Interpretable Distributional Reinforcement Learning using Uncertain Contraction Metrics for Precise Quadrotor Trajectory Tracking
Accuracy and stability are common requirements for Quadrotor trajectory tracking systems. Designing an accurate and stable tracking controller remains challenging, particularly in unknown and dynamic environments with complex aerodynamic disturbances. We propose a Quantile-approximation-based Distributional-reinforced Uncertainty Estimator (QuaDUE) to accurately identify the effects of aerodynamic disturbances, i.e., the uncertainties between the true and estimated Control Contraction Metrics (CCMs). Taking inspiration from contraction theory and integrating the QuaDUE for uncertainties, our novel CCM-based trajectory tracking framework tracks any feasible reference trajectory precisely whilst guaranteeing exponential convergence. More importantly, the convergence and training acceleration of the distributional RL are guaranteed and analyzed, respectively, from theoretical perspectives. We also demonstrate our system under unknown and diverse aerodynamic forces. Under large aerodynamic forces (>2m/s^2), compared with the classic data-driven approach, our QuaDUE-CCM achieves at least a 56.6% improvement in tracking error. Compared with QuaDRED-MPC, a distributional RL-based approach, QuaDUE-CCM achieves at least a 3 times improvement in contraction rate.
- Open Access
- 13 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 59301-59312
Optimal Recharge Scheduler for Drone-to-Sensor Wireless Power Transfer
Wireless recharging by autonomous power delivery vehicles is an attractive maintenance solution for Internet of Things devices. Improving the operating efficiency of power delivery vehicles is challenging due to complex dynamic environments and the need to solve difficult optimization problems to determine the best combination of routes, number of vehicles, and numerous safety thresholds prior to deployment. The optimal recharge scheduling problem considers minimizing discharged energy of drones while maximizing devices' recharged energy. In this paper, a configurable optimal recharge scheduler is proposed that incorporates several evolutionary and clustering approaches. A modified version of the Black Hole algorithm is presented, which is shown to execute on average 35% faster than the state of the art genetic approach, while delivering comparable performance in simulation across 18 scenarios with varying area and density of sensor nodes deployed under different initialization scenarios.
- 13 April 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 59301-59312
Open AccessOptimal Recharge Scheduler for Drone-to-Sensor Wireless Power Transfer
Wireless recharging by autonomous power delivery vehicles is an attractive maintenance solution for Internet of Things devices. Improving the operating efficiency of power delivery vehicles is challenging due to complex dynamic environments and the need to solve difficult optimization problems to determine the best combination of routes, number of vehicles, and numerous safety thresholds prior to deployment. The optimal recharge scheduling problem considers minimizing discharged energy of drones while maximizing devices' recharged energy. In this paper, a configurable optimal recharge scheduler is proposed that incorporates several evolutionary and clustering approaches. A modified version of the Black Hole algorithm is presented, which is shown to execute on average 35% faster than the state of the art genetic approach, while delivering comparable performance in simulation across 18 scenarios with varying area and density of sensor nodes deployed under different initialization scenarios.