arXiv subjects

Greg Droge

Publications and source records attributed to Greg Droge.

12 recordsLinked to original sources

arXiv2024

Scheduling Battery-Electric Bus Charging under Stochasticity using a Receding-Horizon Approach

A significant challenge of adopting battery electric buses into fleets lies in scheduling the charging, which in turn is complicated by considerations such as timing constraints imposed by routes, long charging times, limited numbers of chargers, and utility cost structures. This work builds on previous network-flow-based charge scheduling approaches and includes both consumption and demand time-of-use costs while accounting for uncontrolled loads on the same meter. Additionally, a variable-rate, non-linear partial charging model compatible with the mixed-integer linear program (MILP) is developed for increased charging fidelity. To respond to feedback in an uncertain environment, the resulting MILP is adapted to a hierarchical receding horizon planner that utilizes a static plan for the day as a reference to follow while reacting to stochasticity on a regular basis. This receding horizon planner is analyzed with Monte-Carlo techniques alongside two other possible planning methods. It is found to provide up to 52\% cost savings compared to a non-time-of-use aware method and significant robustness benefits compared to an optimal open-loop method.

eess.SY↗

arXiv2024

A Position Allocation Approach to the Scheduling of Battery-Electric Bus Charging

Robust charging schedules in a growing market of battery electric bus (BEB) fleets are a critical component to successful adoption. In this paper, a BEB charging scheduling framework that considers spatiotemporal schedule constraints, route schedules, fast and slow charging, and battery dynamics is modeled as a mixed integer linear program (MILP). The MILP is modeled after the Berth Allocation Problem (BAP) in a modified form known as the Position Allocation Problem (PAP). Linear battery dynamics are included to model the charging of buses while at the station. To model the BEB discharges over their respective routes, it is assumed each BEB has an average kWh charge loss while on route. The optimization coordinates BEB charging to ensure that each vehicle remains above a specified state-of-charge (SOC). The model also minimizes the total number of chargers utilized and prioritizes slow charging for battery health. The model validity is demonstrated with a set of routes sampled from the Utah Transit Authority (UTA) for \A buses and \N visits to the charging station. The model is also compared to a heuristic algorithm based on charge thresholds referred to as the Qin-Modified method. The results presented show that the slow chargers are more readily selected and the charging and spatiotemporal constraints are met while considering the battery dynamics and minimizing both the charger count and consumption cost.

math.OC↗

arXiv2023

Fillet-based RRT: A Rapid Convergence Implementation of RRT for Curvature Constrained Vehicles

Rapidly exploring random trees (RRTs) have proven effective in quickly finding feasible solutions to complex motion planning problems. RRT* is an extension of the RRT algorithm that provides probabilistic asymptotic optimality guarantees when using straight-line motion primitives. This work provides extensions to RRT and RRT* that employ fillets as motion primitives, allowing path curvature constraints to be considered when planning. Two fillets are developed, an arc-based fillet that uses circular arcs to generate paths that respect maximum curvature constraints and a spline-based fillet that uses Bezier curves to additionally respect curvature continuity requirements. Planning with these fillets is shown to far exceed the performance of RRT* using Dubin's path motion primitives, approaching the performance of planning with straight-line path primitives. Path sampling heuristics are also introduced to accelerate convergence for nonholonomic motion planning. Comparisons to established RRT* approaches are made using the Open Motion Planning Library (OMPL).

cs.RO↗

arXiv2023

Batch Informed Trees (BIT*)

Path planning through complex obstacle spaces is a fundamental requirement of many mobile robot applications. Recently a rapid convergence path planning algorithm, Batch Informed Trees (BIT*), was introduced. This work serves as a concise write-up and explanation of BIT*. This work includes a description of BIT* and how BIT* operates, a graphical demonstration of BIT*, and simulation results where BIT* is compared to Optimal Rapidly-exploring Random Trees (RRT*).

cs.RO↗

arXiv2022

Path Planning with Uncertainty for Aircraft Under Threat of Detection from Ground-Based Radar

Mission planners for aircraft operating under threat of detection by ground-based radar systems are concerned with the probability of detection. Current path planning methods for such scenarios consider the aircraft pose, radar position, and radar parameters to be deterministic and known. This paper presents a framework for incorporating uncertainty in these quantities into a radar detection model that is used by a path planner. The developed path planner evaluates the radar detection risk in the presence of uncertainties and uses linear covariance analysis to efficiently generate error budgets. The error budgets identify the contribution of each source of uncertainty (e.g., sensor measurement noise, radar position uncertainty) to the overall variability in the probability of detection. The framework is applied to a modified visibility graph path planner that uses the detection risk and its variability to calculate path adjustments, which maintain the detection risk below a specified threshold. The results show that the framework is effective at providing actionable information to the mission planner that improves the final planned path and reduces the detection risk.

eess.SY↗

arXiv2022

Sensitivity of Single-Pulse Radar Detection to Radar State Uncertainty

Mission planners for aircraft operating under threat of detection from ground-based radar systems are often concerned with the probability of detection. Current approaches to path planning in such environments consider the radar state (i.e. radar position and parameters) to be deterministic and known. In practice, there is uncertainty in the radar state which induces uncertainty in the probability of detection. This paper presents a method to incorporate the uncertainty of the radar state in a single-pulse radar detection model. The method linearizes the radar detection model with respect to the the radar state and uses the linearized models to estimate, to the first order, the variance of the probability of detection. The results in this paper validate the linearization using Monte Carlo analysis and illustrate the sensitivity of the probability of detection to radar state uncertainty.

eess.SY↗

arXiv2022

Sensitivity of Single-Pulse Radar Detection to Aircraft Pose Uncertainties

Mission planners for aircraft that operate in radar detection environments are often concerned the probability of detection. The probability of detection is a nonlinear function of the aircraft pose and radar position. Current path planning techniques for this application assume that the aircraft pose is deterministic. In practice, however, the aircraft pose is estimated using a navigation filter and therefore contains uncertainty. The uncertainty in the aircraft pose induces uncertainty in the probability of detection, but this phenomenon is generally not considered when path planning. This paper provides a method for combining aircraft pose uncertainty with single-pulse radar detection models to aid mission planning efforts. The method linearizes the expression for the probability of detection and three radar cross section models. The linearized models are then used to determine the variability of the probability of detection induced by uncertainty in the aircraft pose. The results of this paper validate the linearization using Monte Carlo analysis and explore the sensitivity of the probability of detection to aircraft pose uncertainty.

eess.SY↗

arXiv2021

A Closed-Loop Linear Covariance Framework for Vehicle Path Planning in a Static Uncertain Obstacle Fiel

Path planning in an uncertain environment is a key enabler of true vehicle autonomy. Over the past two decades, numerous approaches have been developed to account for errors in the vehicle path while navigating complex and often uncertain environments. An important capability of such planning is the prediction of vehicle dispersion covariances about a candidate path. This work develops a new closed-loop linear covariance (CL-LinCov) framework applicable to a wide range of autonomous system architectures. Important features of the developed framework include the (1) separation of high-level guidance from low-level control, (2) support for output-feedback controllers with internal states, dynamics, and output, and (3) multi-use continuous sensors for navigation state propagation, guidance, and feedback control. The closed-loop nature of the framework preserves the important coupling between the system dynamics, exogenous disturbances, and the guidance, navigation, and control algorithms. The developed framework is applied to a simplified model of an unmanned aerial vehicle and validated by comparison via Monte Carlo analysis. The utility of the CL-LinCov information is illustrated by its application to path planning in a static, uncertain obstacle field via a modified version of the Rapidly Exploring Random Tree algorithm.

cs.RO↗

arXiv2021

Analytical Aircraft State and IMU Signal Generator from Smoothed Reference Trajectory

This work presents a method for generating position, attitude, and velocity states for an aircraft following a smoothed reference trajectory. The method also generates accelerometer and gyro measurements consistent with the aircraft states. This work describes three corner smoothing algorithms for generating a smoothed reference trajectory from a series waypoints that accounts for limitations in the physical system. The smoothed reference trajectory, and curvilinear motion theory are used to generate the lower-order states. A coordinated turn maneuver is then applied to generate accelerometer and gyro measurement estimates.

eess.SY↗

arXiv2020

Zero-Error Tracking for Autonomous Vehicles through Epsilon-Trajectory Generation

This paper presents a control method and trajectory planner for vehicles with first-order nonholonomic constraints that guarantee asymptotic convergence to a time-indexed trajectory. To overcome the nonholonomic constraint, a fixed point in front of the vehicle can be controlled to track a desired trajectory, albeit with a steady-state error. To eliminate steady state error, a sufficiently smooth trajectory is reformulated for the new reference point such that, when tracking the new trajectory, the vehicle asymptotically converges to the original trajectory. The resulting zero-error tracking law is demonstrated through a novel framework for creating time-indexed Clothoids. The Clothoids can be planned to pass through arbitrary waypoints using traditional methods yet result in trajectories that can be followed with zero steady-state error. The results of the control method and planner are illustrated in simulation wherein zero-error tracking is demonstrated.

eess.SY↗

arXiv2018

Dual-mode Dynamic Window Approach to Robot Navigation with Convergence Guarantees

In this paper, a novel, dual-mode model predictive control framework is introduced that combines the dynamic window approach to navigation with reference tracking controllers. This adds a deliberative component to the obstacle avoidance guarantees present in the dynamic window approach as well as allow for the inclusion of complex robot models. The proposed algorithm allows for guaranteed convergence to a goal location while navigating through an unknown environment at relatively high speeds. The framework is applied in both simulation and hardware implementation to demonstrate the computational feasibility and the ability to cope with dynamic constraints and stability concerns.

eess.SY↗

arXiv2013

Continuous-time Proportional-Integral Distributed Optimization for Networked Systems

In this paper we explore the relationship between dual decomposition and the consensus-based method for distributed optimization. The relationship is developed by examining the similarities between the two approaches and their relationship to gradient-based constrained optimization. By formulating each algorithm in continuous-time, it is seen that both approaches use a gradient method for optimization with one using a proportional control term and the other using an integral control term to drive the system to the constraint set. Therefore, a significant contribution of this paper is to combine these methods to develop a continuous-time proportional-integral distributed optimization method. Furthermore, we establish convergence using Lyapunov stability techniques and utilizing properties from the network structure of the multi-agent system.

eess.SY↗