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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Christopher Vermillion

dblp:49/7138 · also Chris Vermillion · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
6since 2021 · last 2026
0000-0001-9481-6956ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 4 · 4 since 2021Artificial intelligence and machine learning · 2 · 2 since 2021Systems, architecture and hardware · 1 · 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
1 paper
Motion planning and robot control · 54% Robot navigation and mapping · 23% Reinforcement learning · 23%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › path planning
coverage path planning
0.812024
Eclares: Energy-Aware Clarity-Driven Ergodic Search · ICRA 2024
Machine learning › Reinforcement learning › exploration
ergodic search
0.812024
Eclares: Energy-Aware Clarity-Driven Ergodic Search · ICRA 2024
Robotics › Robot navigation and mapping › mobile robot navigation › navigation planning
informative path planning
0.812024
Eclares: Energy-Aware Clarity-Driven Ergodic Search · ICRA 2024
Robotics › Motion planning and robot control › path planning › coverage path planning
persistent coverage
0.812024
Eclares: Energy-Aware Clarity-Driven Ergodic Search · ICRA 2024
Robotics › Motion planning and robot control
trajectory optimization
0.212024
Eclares: Energy-Aware Clarity-Driven Ergodic Search · ICRA 2024

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

ergodic trajectory optimization · 0.8clarity-based information measure · 0.8
YearPublicationVenuePosition
2026 Multi-agent reinforcement learning for energy-efficient heterogeneous platooning
Christopher Vermillion
Expert Syst. Appl.2
2024 Eclares: Energy-Aware Clarity-Driven Ergodic Search
abstract
Planning informative trajectories while considering the spatial distribution of the information over the environment, as well as constraints such as the robot’s limited battery capacity, makes the long-time horizon persistent coverage problem complex. Ergodic search methods consider the spatial distribution of environmental information while optimizing robot trajectories; however, current methods lack the ability to construct the target information spatial distribution for environments that vary stochastically across space and time. Moreover, current coverage methods dealing with battery capacity constraints either assume simple robot and battery models or are computationally expensive. To address these problems, we propose a framework called Eclares, in which our contribution is two-fold. 1) First, we propose a method to construct the target information spatial distribution for ergodic trajectory optimization using clarity, an information measure bounded between [0, 1]. The clarity dynamics allow us to capture information decay due to a lack of measurements and to quantify the maximum attainable information in stochastic spatiotemporal environments. 2) Second, instead of directly tracking the ergodic trajectory, we introduce the energy-aware (eware) filter, which iteratively validates the ergodic trajectory to ensure that the robot has enough energy to return to the charging station when needed. The proposed eware filter is applicable to nonlinear robot models and is computationally lightweight. We demonstrate the working of the framework through a simulation case study. [Code]a[Video]b
Kaleb Ben Naveed, Devansh Agrawal, Christopher Vermillion, Dimitra Panagou
ICRA3
2022 Hierarchical Control of Heavy-Duty Trucks Through Signalized Intersections With Non-Deterministic Signal Timing
abstract
This paper presents a hierarchical Green-Light Approach Speed (h-GLAS) strategy for controlling heavy-duty trucks traveling through urban/suburban environments, where future intersection signal phase and timing (SPaT) information is non-deterministic. Through vehicle-to-infrastructure communication, past SPaT information is sent to the vehicle and is used to forecast future predictions of the signal timing using a Gaussian Process (GP) model. The h-GLAS strategy uses the predicted SPaT information to generate an efficient desired velocity profile that navigates through intersections where the probability of a green light is maximized. This velocity profile is tracked by a convex model predictive controller (MPC) that simultaneously minimizes mechanical energy expenditure and braking effort over its prediction horizon. Downstream from the MPC, we implement a command governor (CG) that adjusts the MPC output by the minimum amount necessary to maintain safe vehicle following and ensure that the vehicle stops at all red lights. Using a proprietary medium-fidelity Simulink model provided by Volvo Trucks, we characterize the h-GLAS strategy’s performance over a real suburban route, consisting of 10 actuated signalized intersections, using actual SPaT information provided by the NC Department of Traffic (DOT). Simulation results demonstrate a 30-43% reduction in fuel consumption, as compared to a baseline control strategy, which is attributable primarily to avoiding the massive energy losses associated with braking. Furthermore, we evaluate the computational efficiency of our approach by assessing average simulation execution times.
John Borek, Ben Groelke, Christian Earnhardt, Christopher Vermillion
IEEE Trans. Intell. Transp. Syst.4
2022 Cooperative Exchange-Based Platooning Using Predicted Fuel-Optimal Operation of Heavy-Duty Vehicles
abstract
Several driving situations exist where fuel-optimal driving in terms of aggregate performance can only be achieved when one or more vehicles incurs a sacrifice in its own fuel consumption. For these situations, an economic incentive is needed to entice that vehicle to participate in aggregate fuel-optimal driving. Focusing on platooning amongst automated heavy-duty vehicles and using real trucking routes, we examine the precise extent to which the benefits of platooning can be expanded through the incorporation of exchange-based incentives. We focus on two mechanisms for incentivized platooning: (i) incentivized “catch-up” along a prescribed highway route and (ii) incentivized re-routing to allow for platooning. For the incentivized “catch-up” mechanism, platoon capable vehicles begin at staggered positions, using a novel platoon catch-up algorithm capable of determining the fuel-optimal platoon engagement position and fuel-optimal velocity trajectories. Additionally, the incentivized re-routing mechanism determines the optimal route for a network of platoon-capable vehicles, allowing for a vehicle to reroute its trajectory to engage within the platoon. Because such scenarios will be shown to frequently lead to aggregate benefit, while actually hurting the fuel economy of one or more participants, we propose three methods for explicitly computing the monetary value of the exchange. Assuming a known trajectory and traffic pattern, the first uses the Shapley value to determine the exchange value. The second method adjusts the Shapley value, accounting for uncertainty associated with traffic modeling. The final method assumes a competitive market, requiring each individual operator to implement a bid.
Christian Earnhardt, Ben Groelke, John Borek, Evan Pelletier, Sean Brennan 0001, Christopher Vermillion
IEEE Trans. Intell. Transp. Syst.6
2022 Hierarchical Model Predictive Control Approaches for Strategic Platoon Engagement of Heavy-Duty Trucks
abstract
For a group of vehicles, collaborative platooning can be valuable in certain situations due to aerodynamic drag reduction, while being detrimental or altogether impractical in others. This paper details a platoon engagement/disengagement controller, which alternates between velocity trajectory optimization (VTO) in isolation and a fused platooning and VTO approach, capable of disengaging a platoon during segments detrimental to fuel savings and rejoining the platoon afterwards without significant energy expenditure. The proposed approach leverages parallel model predictive control (MPC) computations that (i) can identify when a platoon should be engaged/disengaged and (ii) performs the engagement/disengagement in a fuel-optimal manner. Using a medium-fidelity Simulink model furnished by Volvo, two real-world trucking routes, and two different traffic scenarios, the effectiveness of the approach was compared against non-platooning VTO, as well as a baseline controller that uses a PI-based cruise controller that incorporates Gipps car-following model. Results for a two-vehicle platoon using a 1 vehicle following distance reveal a 9.6% to 11.9% decrease in aggregate fuel consumption for both vehicles within the platoon, as compared to the baseline, highlighting the ability to disengage and rejoin a platoon without expending unnecessary fuel consumption. Additionally, the approaches for disengaging a platoon result in a 4-7% decrease in aggregate fuel consumption, as compared to a VTO-only approach.
Christian Earnhardt, Ben Groelke, John Borek, Christopher Vermillion
IEEE Trans. Intell. Transp. Syst.4
2022 A Predictive Command Governor-Based Adaptive Cruise Controller With Collision Avoidance for Non-Connected Vehicle Following
abstract
This paper presents a command governor (CG) based adaptive cruise controller (ACC) that is applied in simulation to normal driving scenarios and emergency stopping scenarios. The vehicle-following case study used in this paper involves a heavy-duty ego vehicle and a light-dutynon-connectedlead vehicle (i.e., the ego vehicle does not communicate with the lead vehicle and can only infer the lead vehicles’ position and velocity states through its own sensors). Typically, to ensure constraints in the presence of disturbances, receding horizon based ACCs will assume some known worst-case behavior of the lead vehicle. In the presence of a stochastic, non-connected lead vehicle, however, achieving such a guarantee requires a worst-case assumption on the behavior of the lead vehicle for all future time. In this work, the CG assumes a lead vehicle velocity profile that will be achieved with a prescribed level of certainty, based on a stochastic characterization of lead vehicle behavior that has been informed by actual on-road data. The CG ensures safe following distance under this probabilistic lead vehicle assumption. Here, “safe following distance” is based on the ego vehicle’s ability to come to a stop without collision if the lead vehicle were to suddenly brake at maximum deceleration after proceeding at a velocity profile that is prescribed based on a statistical lower bound on lead vehicle velocity. Ultimately, the CG ensures that the worst-case safe following distance is satisfied with a prescribed probability, thereby paralleling chance-constrained CG formulations. Simulation results for a heavy-duty truck indicate that the CG-based ACC outperforms a PID-ACC in terms of fuel economy and drivability. Additionally, the CG-ACC approach was able to ensure rear-end collision avoidance in emergency stopping simulations.
Ben Groelke, Christian Earnhardt, John Borek, Christopher Vermillion
IEEE Trans. Intell. Transp. Syst.4