Search NASA⌕ Search

SEARCH · Search NASA

Results for “Maneuver plans”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

11 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Impacts of Distributed Speed Harmonization and Optimal Maneuver Planning on Multi-Lane Roads

A commonly proposed method for improving traffic flow on freeways is speed harmonization. The effectiveness of current speed harmonization approaches, such as variable speed limits, is extremely reliant on human driver compliance. Connected and automated vehicles (CAVs) are expected to come to market within this decade, offering the opportunity to eliminate or reduce the reliance on human compliance. However, extending current roadside infrastructure-based approaches of assigning centrally computed harmonization speeds to individual vehicles is, costly. An alternative approach is to have individual vehicles estimate the traffic state on-board and make distributed decisions to achieve the harmonization goal autonomously. In this work, we present a distributed algorithm for estimating the current average speed of traffic. We couple this with a distributed 2D maneuver planning approach. Then, we study the impact on traffic efficiency in terms of energy consumption and travel time at varying CAV penetration rates.

Goulet, Nathan↗
DOE OSTI2021

Distributed Maneuver Planning With Connected and Automated Vehicles for Boosting Traffic Efficiency

Connected and automated vehicles (CAVs) have the potential to improve traffic throughput and achieve a more efficient utilization of the available roadway infrastructure. They also have the potential to reduce energy consumption through traffic motion harmonization, even when operating in mixed traffic with other human-driven vehicles. The key to realizing these potentials are coordinated control schemes that can be implemented in a distributed manner with the CAVs. In this paper, we propose a distributed predictive control framework that features a two-dimensional maneuver planner incorporating explicit coordination constraints between connected vehicles operating in mixed traffic at various penetration levels. Here, the framework includes a distributed implementation of a reference speed assigner that estimates local traffic speed from on-board measurements and communicated information. We present an extensive evaluation of the proposed framework in traffic micro-simulations at various CAV penetrations from traffic flow, energy use, and lane utilization points of view. Results are compared to a baseline scenario with no CAVs, as well as, a benchmark one-dimensional planner.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2020

CBRN Situational Awareness Tools for the Modern Age

CBRN Situational awareness (SA) should be a key operational requirement in the CNI area of discussion, not only for the “boots-on-the-ground” warfighter, but at a strategic level. For example, maneuver plans will need to be developed for contamination avoidance and battlefield survivability. Large datasets from instruments dispersed across the battlefield will thus need to be collected and processed into a holistic assessment of the radiological hazard. From there, hazard maps then must be distributed at the tactical level, all while continuing to effectively engage a peer adversary. This vision represents a network of sensors, software tools, data processing algorithms, communications suites, and common operational picture (COP) platforms working in concert to inform warfighters and command echelons alike of evolving nuclear and radiological hazards. This complex system-of-systems and the ultimate goal of effective engagement in a nuclear or radiological-hazard battlefield can be achieved through pursuit of improvement in collaborative SA tools.

Becker, Eric M.↗
DOE OSTI2021

Formation and reconfiguration of tight multi-lane platoons

Advances in vehicular communication technologies are expected to facilitate cooperative driving in the future. Connected and Automated Vehicles (CAVs) are able to collaboratively plan and execute driving maneuvers by sharing their perceptual knowledge and future plans. In this paper, an architecture for autonomous navigation of tight multi-lane platoons traveling on public roads is presented. Using the proposed approach, CAVs are able to form single or multi-lane platoons of various geometrical configurations. They are able to reshape and adjust their configurations according to changes in the environment. The proposed architecture consists of two main components: an offline motion planner system and an online hierarchical control system. The motion planner uses an optimization-based approach for cooperative formation and reconfiguration in tight spaces. A constrained optimization scheme is used to plan smooth, dynamically feasible and collision-free trajectories for all the vehicles within the platoon. The paper addresses online computation limitations by employing a family of maneuvers precomputed offline and stored on a look-up table on the vehicles. The online hierarchical control system is composed of three levels: a traffic operation system (TOS), a decision-maker, and a path-follower. The TOS determines the desired platoon reconfiguration. The decision-maker checks the feasibility of the reconfiguration plan based on real-time information about the surrounding traffic. The reconfiguration maneuver is executed by a low-level path-following feedback controller in real-time. The effectiveness of the approach is demonstrated through simulations of three case studies: (1) formation reconfiguration (2) obstacle avoidance, and (3) benchmarking against behavior-based planning in which the desired formation is achieved using a sequence of motion primitives.

42 ENGINEERING↗
DOE OSTI2024

HumoNet: A Framework for Realistic Modeling and Simulation of Human Mobility Network

Understanding, analyzing, and predicting human mobility and dynamics are valuable to solving pressing problems, developing effective plans, and prescribing timely remedies. As a computational approach, realistic human mobility simulations allow us to understand, analyze, and predict complex systems, including human societies. Accurate simulations rely on (1) the model that captures interactions and behaviors of myriad entities in our society and (2) the mapping of model instances to real-world entities. Taking this into account, this paper introduces the Human Mobility Network simulation framework (HumoNet), an integrated patterns of life (POL) simulation framework that leverages real-world data layers including transportation networks, points of interest, populations, popularity, and human trajectories. HumoNet is a data informed model in which agents are equipped with activities, locomotion, and planning capabilities. To simulate realistic kinematic maneuvers of individuals in transportation networks, HumoNet harnesses a microscopic traffic simulator that provides interaction among vehicles and traffic objects. In this paper, we describe the framework, outline our methodologies, and discuss the data processing and challenges of each data layer. Through experiments, we demonstrate that our simulations capture key features of human mobility by comparing them to the literature and real data using standard measures of human mobility (i.e., the radius of gyration, number of locations visited, level of exploration) and metrics scoring (i.e., Jensen-Shannon divergence). We envision that the synthetic data produced by HumoNet will serve as a benchmark for analyzing epidemics, deploying EV charging networks, and validating AI/ML tasks such as location prediction.

Kim, Joon-Seok↗
DOE OSTI2024

The ReSWARM microgravity flight experiments: Planning, control, and model estimation for on‐orbit close proximity operations

Abstract On‐orbit close proximity operations involve robotic spacecraft maneuvering and making decisions for a growing number of mission scenarios demanding autonomy, including on‐orbit assembly, repair, and astronaut assistance. Of these scenarios, on‐orbit assembly is an enabling technology that will allow large space structures to be built in situ, using smaller building block modules. However, like many of these scenarios, robotic on‐orbit assembly involves several technical hurdles, such as changing system models. For instance, grappled modules moved by a free‐flying “assembler” robot can cause significant changes in the combined system inertia, which have cascading impacts on motion planning and control portions of the autonomy stack. Further, on‐orbit assembly and other scenarios require collision‐avoiding motion planning, particularly when operating in a “construction site” scenario of multiple assembler robots and structures. Multiple key technologies that address these complicating factors for autonomous microgravity close proximity operations are detailed in this work, in particular: (1) application of global long‐horizon planning, accomplished using offline and online sampling‐based planner options that consider the system dynamics; (2) adaptation of the recently proposed RATTLE information‐aware planning framework for on‐orbit reconfiguration model learning; and (3) connection with robust control tools to provide low‐level control robustness using current system knowledge. These approaches were demonstrated for an autonomous on‐orbit assembly use case by the RElative Satellite sWarming and Robotic Maneuvering (ReSWARM) experiments using NASA's Astrobee robots on the International Space Station. Results of the ReSWARM experiments are provided along with significant operational and implementation detail discussing the practicalities of hardware implementation and unique aspects of working with the Astrobee free‐flyer robots in microgravity. ReSWARM provides a base set of planning and control tools for robotic close proximity operations, demonstrates them in microgravity, and outlines some of the important hardware aspects that future autonomous free‐flyers will need to consider.

Robotics↗
DOE OSTI2025

Integrating vehicle trajectory planning and arterial traffic management to facilitate eco-approach and departure deployment

Eco-approach and departure (EAD) enable continuous vehicle motion in urban signalized corridors. Since such a motion can extend to the EAD vehicles’ followers, it makes EAD a promising technology to benefit the traffic flow where automated vehicles and conventional vehicles coexist. Most existing EAD studies envision an ideal setting that neglects real-world operational conditions such as lane changes, multi-movement intersection configuration, partially automated fleet, and/or limited traffic state awareness. This study aims to fill the gap by designing an EAD algorithm considering real-world traffic operation constraints. The proposed algorithm uses a model predictive controller to minimize vehicle speed reduction and variation based on the real-time traffic signal control plan and measured queues at the intersection. The required inputs are readily available at many modern intersections. We observed that the proposed controller’s performance might degrade because of lane-changing maneuvers and lead-left turn traffic signals. These observations motivated our development of a lane change management strategy and a signal control implementation strategy to facilitate the EAD implementation. The lane change management strategies separate the EAD operations and lane-changing maneuvers in time and space. The signal control implementation strategy applies lag-left turn signals to enable EAD operation for both the through and left-turn vehicles. Compared to the non-EAD case, our EAD approach produces 2.5% to 7.8% energy savings while keeping similar intersection mobility. Notably, this approach brings about 2.5% to 3.6% energy savings in a 2% CAV case. This result demonstrates the feasibility of deploying EAD at low connected automated vehicle penetration rates.

Arterial corridor management↗
DOE OSTI2020

Multi-agent motion planning with sporadic communications for collision avoidance

Here, a novel multi-vehicle motion planning and collision avoidance algorithm is proposed and analyzed. The algorithm aims to reduce the amount of onboard calculations and inter-agent communications needed for each vehicle to successfully navigate through an environment with static obstacles and reach their goals. To this end, each agent first calculates a path to the goal by means of an asymptotically optimal rapidly-exploring random tree (RRT*) with respect to the static obstacles. Then, other agents are treated as dynamic obstacles and potential collisions are determined by means of collision cones. Collision cones depend on the position and velocity from other agents and are grown conservatively between inter-agent communications. Based on the available information, each agent determines if a deconfliction maneuver is needed, if it can continue along its current path, or if communication is needed to make a decision about a conflict. With probability one, our algorithm guarantees that the agents keep from colliding with each other. Under an assumption on the existence of a solution for a vehicle to its goal, this algorithm also solves the planning problem with probability one. Simulations illustrate a group of agents successfully reaching their goal configurations and examine how the uncertainty affects the communication frequency of the multi-agent system.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

Investigation into Scalable and Detection-Enhanced Satellite Conjunction Assessment

Imaging opportunities (viewable conjunctions) of Resident Space Objects (RSOs) by satellites are not continuously discovered. We propose to continuously produce and report viewable conjunctions among objects in orbit. Viewable conjunctions are events in space and time when a satellite may favorably view a Resident Space Object (RSO). Favorability is defined by a set of constraints, e.g., solar illumination, distance between observer and target, orbital location for viewable event. Computing viewable conjunctions requires calculation of orbital propagation while considering constraints based on the state vectors of position, velocity, with covariance for both satellite and RSO. We propose two parallel lanes of effort: acceleration and research. The objective of acceleration is to avoid missed opportunities and reduce latency for satellite maneuver requests through continuous prediction and reporting of viewable conjunctions. The effort will begin by deploying currently available software on dedicated systems and continue with optimizing the code for high performance computing hardware. The research lane aims to expand RSO inspection and modeling capabilities. Among our current research ideas are spectral characterization of RSO materials and planning multiple observations to recover RSO 3D form. Computing resources at Oak Ridge National Laboratory (ORNL) are available for the acceleration work. Laika, Maxar conjunction prediction dashboard software, and Bluesim, Maxar orbital propagation software, are expected to be the first software in the acceleration lane. Laike and Bluesim are to be provided by the sponsor, and output will be made accessible through its dashboard. Deliverables will follow a gated schedule to the sponsor. ORNL will provide progressively more robust viewable conjunction assessments from both modelled and actual ephemerides.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Automated Construction of Artificial Lattice Structures with Designer Electronic States

Manipulating matter with a scanning tunneling microscope (STM) enables the creation of atomically defined artificial structures that host designer quantum states. However, the time-consuming nature of the manipulation process, coupled with the sensitivity of the STM tip, constrains the exploration of diverse configurations and limits the size of the designed features. In this study, we present a reinforcement learning (RL)-based framework for creating artificial structures by spatially manipulating carbon monoxide (CO) molecules on a copper substrate by using the STM tip. The automated workflow combines molecule detection and manipulation, employing deep-learning-based object detection to locate CO molecules and linear assignment algorithms to allocate these molecules to designated target sites. We initially perform molecule maneuvering based on randomized parameter sampling for sample bias, tunneling current set point, and manipulation speed. This data set is then structured into an action trajectory used to train an RL agent. The model is subsequently deployed on the STM for real-time fine-tuning of the manipulation parameters during structure construction. Our approach incorporates path-planning protocols coupled with active drift compensation to enable atomically precise fabrication of structures with significantly reduced human input while realizing larger-scale artificial lattices with the desired electronic properties. Furthermore, using our approach, we demonstrate the automated construction of an extended artificial graphene lattice and confirm the existence of a characteristic Dirac point in its electronic structure. Further challenges regarding the RL-based structural assembly scalability are discussed.

Algorithms↗
DOE OSTI2023

Selecting Minimal Motion Primitive Libraries with Genetic Algorithms

Motion primitives allow for application of discrete search algorithms to rapidly produce trajectories in complex continuous space. The maneuver automaton (MA) provides an elegant formulation for creating a primitive library based on trims and maneuvers. However, performance is fundamentally limited by the contents of the primitive library. If the library is too sparse, performance can be poor in terms of path cost, whereas a library that is too large can increase run time. This work outlines new methods for using genetic algorithms to prune a primitive library. The proposed methods balance the path cost and planning time while maintaining the reachability of the MA. The genetic algorithm in this paper evaluates and mutates populations of motion primitive libraries to optimize both objectives. Here, we illustrate the performance of these methods with a simulated study using a nonlinear medium-fidelity F-16 model. We optimize a library with the presented algorithm for obstacle-free navigation and a nap-of-the-Earth navigation task. In the obstacle-free navigation task, we show a tradeoff of a 10.16% higher planning cost for a 96.63% improvement in run time. In the nap-of-the-Earth task, we show a tradeoff of a 9.712% higher planning cost for a 92.06% improvement in run time.

42 ENGINEERING↗