Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Qiuchen Qian

dblp:290/9288 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0002-5888-246XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Computer networks · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Motion planning and robot control · 59% Reinforcement learning · 18% Trustworthy machine learning · 18%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
constrained reinforcement learning
0.812024
Probabilistic Constrained Reinforcement Learning with Formal Interpretability · ICML 2024
Machine learning › Trustworthy machine learning
interpretability
0.812024
Probabilistic Constrained Reinforcement Learning with Formal Interpretability · ICML 2024
Robotics › Motion planning and robot control › robot control
model predictive control
0.612022
KinoJGM: A framework for efficient and accurate quadrotor trajectory generation and tracking in dynamic environments · ICRA 2022
Robotics › Motion planning and robot control › trajectory planning
quadrotor trajectory planning
0.612022
KinoJGM: A framework for efficient and accurate quadrotor trajectory generation and tracking in dynamic environments · ICRA 2022
Robotics › Motion planning and robot control
trajectory planning
0.612022
KinoJGM: A framework for efficient and accurate quadrotor trajectory generation and tracking in dynamic environments · ICRA 2022
Robotics › Motion planning and robot control › robot control
trajectory tracking
0.612022
KinoJGM: A framework for efficient and accurate quadrotor trajectory generation and tracking in dynamic environments · ICRA 2022
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.212024
Probabilistic Constrained Reinforcement Learning with Formal Interpretability · ICML 2024
Robotics › Motion planning and robot control
collision avoidance
0.212022
KinoJGM: A framework for efficient and accurate quadrotor trajectory generation and tracking in dynamic environments · ICRA 2022

Methods — techniques the papers use, named apart from their topics

wasserstein variational optimization · 0.8formal methods · 0.8model predictive control · 0.6kinodynamic jump space search · 0.6gaussian process · 0.6
YearPublicationVenuePosition
2025 Adaptive Probabilistic Planning for the Uncertain and Dynamic Orienteering Problem
abstract
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.
Qiuchen Qian, Yanran Wang 0001, David Boyle 0001
IEEE Internet Things J.1
2024 Probabilistic Constrained Reinforcement Learning with Formal Interpretability
abstract
Reinforcement learning can provide effective reasoning for sequential decision-making problems with variable dynamics. Such reasoning in practical implementation, however, poses a persistent challenge in interpreting the reward function and the corresponding optimal policy. Consequently, representing sequential decision-making problems as probabilistic inference can have considerable value, as, in principle, the inference offers diverse and powerful mathematical tools to infer the stochastic dynamics whilst suggesting a probabilistic interpretation of policy optimization. In this study, we propose a novel Adaptive Wasserstein Variational Optimization, namely AWaVO, to tackle these interpretability challenges. Our approach uses formal methods to achieve the interpretability: convergence guarantee, training transparency, and intrinsic decision-interpretation. To demonstrate its practicality, we showcase guaranteed interpretability including a global convergence rate $\Theta(1/\sqrt{T})$ not only in simulation but also in real-world quadrotor tasks. In comparison with state-of-the-art benchmarks, including TRPO-IPO, PCPO, and CRPO, we empirically verify that AWaVO offers a reasonable trade-off between high performance and sufficient interpretability.
Yanran Wang 0001, Qiuchen Qian, David Boyle 0001
ICML2
2022 KinoJGM: A framework for efficient and accurate quadrotor trajectory generation and tracking in dynamic environments
abstract
Unmapped areas and aerodynamic disturbances render autonomous navigation with quadrotors extremely challenging. To fly safely and efficiently, trajectory planners and trackers must be able to navigate unknown environments with unpredictable aerodynamic effects in real-time. When encountering aerodynamic effects such as strong winds, most current approaches to quadrotor trajectory planning and tracking will not attempt to deviate from a determined plan, even if it is risky, in the hope that any aerodynamic disturbances can be resisted by a robust controller. This paper presents a novel systematic trajectory planning and tracking framework for autonomous quadrotors. We propose a Kinodynamic Jump Space Search (Kino-JSS) to generate a safe and efficient route in unknown environments with aerodynamic disturbances. A real-time Gaussian Process is employed to model the errors caused by aerodynamic disturbances, which we then integrate with a Model Predictive Controller to achieve efficient and accurate trajectory optimization and tracking. We demonstrate our system to improve the efficiency of trajectory generation in unknown environments by up to 75% in the cases tested, compared with recent state-of-the-art. We also show that our system improves the accuracy of tracking in selected environments with unpredictable aerodynamic effects. Our implementation is available in an open source package11https://github.com/Alex-yanranwang/Imperial-KinoJGM.
Yanran Wang 0001, James O'Keeffe, Qiuchen Qian, David Boyle 0001
ICRA3