John-Paul Clarke
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
John-Paul Clarke has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
- Daniel Delahaye
Lab ENAC, Ecole Nationale de l’Aviation Civile, Université de Toulouse, 31400 Toulouse, France
3 shared publications Anahita Jain
2 shared publications- Eric Feron
Computer, Electrical and Mathematical Science and Engineering Division, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia
2 shared publications - Siva Theja Maguluri
Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
2 shared publications Ufuk Topcu
2 shared publications- Yue Yu
Oden Institute for Computational Engineering and Sciences, The University of Texas at Austin, Austin, TX, USA
2 shared publications
Latest Publications
- 1 October 2026
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 194
Iterative negotiation and oversight: A case study in decentralized air traffic management
- 1 October 2026
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 194
Iterative negotiation and oversight: A case study in decentralized air traffic management
- 29 September 2026
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 194
Trajectory-based optimization for air traffic control in the terminal maneuvering area
- 29 September 2026
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 194
Trajectory-based optimization for air traffic control in the terminal maneuvering area
- Open Access
Adaptive Traffic-Following Scheme for Orderly Distributed Control of Multi-Vehicle Systems
We present an adaptive control scheme to enable the emergence of order within distributed, autonomous multi-agent systems. Past studies showed that under high-density conditions, order generated from traffic-following behavior reduces travel times, while under low densities, choosing direct paths is more beneficial. In this paper, we leveraged those findings to allow aircraft to independently and dynamically adjust their degree of traffic-following behavior based on the current state of the airspace. This enables aircraft to follow other traffic only when beneficial. Quantitative analyses revealed that dynamic traffic-following behavior results in lower aircraft travel times at the cost of minimal levels of additional disorder to the airspace. The sensitivity of these benefits to temporal and spatial horizons was also investigated. Overall, this work highlights the benefits, and potential necessity, of incorporating self-organizing behavior in making distributed, autonomous multi-agent systems scalable.
Open AccessAdaptive Traffic-Following Scheme for Orderly Distributed Control of Multi-Vehicle Systems
We present an adaptive control scheme to enable the emergence of order within distributed, autonomous multi-agent systems. Past studies showed that under high-density conditions, order generated from traffic-following behavior reduces travel times, while under low densities, choosing direct paths is more beneficial. In this paper, we leveraged those findings to allow aircraft to independently and dynamically adjust their degree of traffic-following behavior based on the current state of the airspace. This enables aircraft to follow other traffic only when beneficial. Quantitative analyses revealed that dynamic traffic-following behavior results in lower aircraft travel times at the cost of minimal levels of additional disorder to the airspace. The sensitivity of these benefits to temporal and spatial horizons was also investigated. Overall, this work highlights the benefits, and potential necessity, of incorporating self-organizing behavior in making distributed, autonomous multi-agent systems scalable.
- 9 May 2025
- Published by Elsevier in Aerospace Science and Technology
- Vol. 163
Developing 3D risk-informed no-fly zones for urban UAS operations
- 9 May 2025
- Published by Elsevier in Aerospace Science and Technology
- Vol. 163
Developing 3D risk-informed no-fly zones for urban UAS operations
- 8 July 2024
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 165
Noise-aware and equitable urban air traffic management: An optimization approach
- 8 July 2024
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 165
Noise-aware and equitable urban air traffic management: An optimization approach
- 16 April 2024
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 162
Optimal cruise airspeed selection and RTA adjustment in the presence of wind uncertainty
- 16 April 2024
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 162
Optimal cruise airspeed selection and RTA adjustment in the presence of wind uncertainty
- 10 January 2024
- Published by Springer Nature
- p. 413-432
Active Risk Mitigation for Unmanned Aerial Systems
- 10 January 2024
- Published by Springer Nature
- p. 413-432
Active Risk Mitigation for Unmanned Aerial Systems
- Open Access
Alpha-Fair Routing in Urban Air Mobility with Risk-Aware Constraints
In the vision of urban air mobility, air transport systems serve the demands of urban communities by routing flight traffic in networks formed by vertiports and flight corridors. We develop a routing algorithm to ensure that the air traffic flow fairly serves the demand of multiple communities subject to stochastic network capacity constraints. This algorithm guarantees that the flight traffic volume allocated to different communities satisfies the \emph{alpha-fairness conditions}, a commonly used family of fairness conditions in resource allocation. It further ensures robust satisfaction of stochastic network capacity constraints by bounding the coherent risk measures of capacity violation. We prove that implementing the proposed algorithm is equivalent to solving a convex optimization problem. We demonstrate the proposed algorithm using a case study based on the city of Austin. Compared with one that maximizes the total served demands, the proposed algorithm promotes even distributions of served demands for different communities.
Open AccessAlpha-Fair Routing in Urban Air Mobility with Risk-Aware Constraints
In the vision of urban air mobility, air transport systems serve the demands of urban communities by routing flight traffic in networks formed by vertiports and flight corridors. We develop a routing algorithm to ensure that the air traffic flow fairly serves the demand of multiple communities subject to stochastic network capacity constraints. This algorithm guarantees that the flight traffic volume allocated to different communities satisfies the \emph{alpha-fairness conditions}, a commonly used family of fairness conditions in resource allocation. It further ensures robust satisfaction of stochastic network capacity constraints by bounding the coherent risk measures of capacity violation. We prove that implementing the proposed algorithm is equivalent to solving a convex optimization problem. We demonstrate the proposed algorithm using a case study based on the city of Austin. Compared with one that maximizes the total served demands, the proposed algorithm promotes even distributions of served demands for different communities.
- Open Access
Target Network and Truncation Overcome The Deadly Triad in $Q$-Learning
$Q$-learning with function approximation is one of the most empirically successful while theoretically mysterious reinforcement learning (RL) algorithms, and was identified in Sutton (1999) as one of the most important theoretical open problems in the RL community. Even in the basic linear function approximation setting, there are well-known divergent examples. In this work, we show that \textit{target network} and \textit{truncation} together are enough to provably stabilize $Q$-learning with linear function approximation, and we establish the finite-sample guarantees. The result implies an $O(\epsilon^{-2})$ sample complexity up to a function approximation error. Moreover, our results do not require strong assumptions or modifying the problem parameters as in existing literature.Open AccessTarget Network and Truncation Overcome The Deadly Triad in $Q$-Learning
$Q$-learning with function approximation is one of the most empirically successful while theoretically mysterious reinforcement learning (RL) algorithms, and was identified in Sutton (1999) as one of the most important theoretical open problems in the RL community. Even in the basic linear function approximation setting, there are well-known divergent examples. In this work, we show that \textit{target network} and \textit{truncation} together are enough to provably stabilize $Q$-learning with linear function approximation, and we establish the finite-sample guarantees. The result implies an $O(\epsilon^{-2})$ sample complexity up to a function approximation error. Moreover, our results do not require strong assumptions or modifying the problem parameters as in existing literature.