The navigation system of the JPL robot

The control structure of the JPL research robot and the operations of the navigation subsystem are discussed. The robot functions as a network of interacting concurrent processes distributed among several computers and coordinated by a central executive. The results of scene analysis are used to create a segmented terrain model in which surface regions are classified by traversibility. The model is used by a path planning algorithm, PATH, which uses tree search methods to find the optimal path to a goal. In PATH, the search space is defined dynamically as a consequence of node testing. Maze-solving and the use of an associative data base for context dependent node generation are also discussed. Execution of a planned path is accomplished by a feedback guidance process with automatic error recovery

Assistive trajectories for human-in-the-loop mobile robotic platforms

Autonomous and semi-autonomous smoothly interruptible trajectories are developed which are highly suitable for application in tele-operated mobile robots, operator on-board military mobile ground platforms, and other mobility assistance platforms. These trajectories will allow a navigational system to provide assistance to the operator in the loop, for purpose built robots or remotely operated platforms. This will allow the platform to function well beyond the line-of-sight of the operator, enabling remote operation inside a building, surveillance, or advanced observations whilst keeping the operator in a safe location. In addition, on-board operators can be assisted to navigate without collision when distracted, or under-fire, or when physically disabled by injury

Geometric Path-Planning Algorithm in Cluttered 2D Environments Using Convex Hulls

Routing or path planning is the problem of finding a collision-free path in an environment usually scattered with multiple objects. Finding the shortest route in a planar (2D) or spatial (3D) environment has a variety of applications such as robot motion planning, navigating autonomous vehicles, routing of cables, wires, and harnesses in vehicles, routing of pipes in chemical process plants, etc. The problem often times is decomposed into two main sub-problems: modeling and representation of the workspace geometrically and optimization of the path. Geometric modeling and representation of the workspace are paramount in any path planning problem since it builds the data structures and provides the means for solving the optimization problem. The optimization aspect of the path planning involves satisfying some constraints, the most important of which is to avoid intersections with the interior of any object and optimizing one or more criteria. The most common criterion in path planning problems is to minimize the length of the path between a source and a destination point of the workspace while other criteria such as minimizing the number of links or curves could also be taken into account. Planar path planning is mainly about modeling the workspace of the problem as a collision-free graph. The graph is, later on, searched for the optimal path using network optimization techniques such as branch-and-bound or search algorithms such as Dijkstra\u27s. Previous methods developed to construct the collision-free graph explore the entire workspace of the problem which usually results in some unnecessary information that has no value but to increase the time complexity of the algorithm, hence, affecting the efficiency significantly. For example, the fastest known algorithm to construct the visibility graph, which is the most common method of modeling the collision-free space, in a workspace with a total of n vertices has a time complexity of order O(n2). In this research, first, the 2D workspace of the problem is modeled using the tessellated format of the objects in a CAD software which facilitates handling of any free-form object. Then, an algorithm is developed to construct the collision-free graph of the workspace using the convex hulls of the intersecting obstacles. The proposed algorithm focuses only on a portion of the workspace involved in the straight line connecting the source and destination points. Considering the worst case that all the objects of the workspace are intersecting, the algorithm yields a time complexity of O(nlog(n/f)), with n being the total number of vertices and f being the number of objects. The collision-free graph is later searched for the shortest path between the two given nodes using a search algorithm known as Dijkstra\u27s

A Neural Model of Visually Guided Steering, Obstacle Avoidance, and Route Selection

A neural model is developed to explain how humans can approach a goal object on foot while steering around obstacles to avoid collisions in a cluttered environment. The model uses optic flow from a 3D virtual reality environment to determine the position of objects based on motion discontinuities, and computes heading direction, or the direction of self-motion, from global optic flow. The cortical representation of heading interacts with the representations of a goal and obstacles such that the goal acts as an attractor of heading, while obstacles act as repellers. In addition the model maintains fixation on the goal object by generating smooth pursuit eye movements. Eye rotations can distort the optic flow field, complicating heading perception, and the model uses extraretinal signals to correct for this distortion and accurately represent heading. The model explains how motion processing mechanisms in cortical areas MT, MST, and posterior parietal cortex can be used to guide steering. The model quantitatively simulates human psychophysical data about visually-guided steering, obstacle avoidance, and route selection.Air Force Office of Scientific Research (F4960-01-1-0397); National Geospatial-Intelligence Agency (NMA201-01-1-2016); National Science Foundation (SBE-0354378); Office of Naval Research (N00014-01-1-0624

A Neural Model of Visually Guided Steering, Obstacle Avoidance, and Route Selection

A neural model is developed to explain how humans can approach a goal object on foot while steering around obstacles to avoid collisions in a cluttered environment. The model uses optic flow from a 3D virtual reality environment to determine the position of objects based on motion discotinuities, and computes heading direction, or the direction of self-motion, from global optic flow. The cortical representation of heading interacts with the representations of a goal and obstacles such that the goal acts as an attractor of heading, while obstacles act as repellers. In addition the model maintains fixation on the goal object by generating smooth pursuit eye movements. Eye rotations can distort the optic flow field, complicating heading perception, and the model uses extraretinal signals to correct for this distortion and accurately represent heading. The model explains how motion processing mechanisms in cortical areas MT, MST, and VIP can be used to guide steering. The model quantitatively simulates human psychophysical data about visually-guided steering, obstacle avoidance, and route selection.Air Force Office of Scientific Research (F4960-01-1-0397); National Geospatial-Intelligence Agency (NMA201-01-1-2016); National Science Foundation (NSF SBE-0354378); Office of Naval Research (N00014-01-1-0624

Providing Nautical Chart Awareness to Autonomous Surface Vehicles

Autonomous surface vessels (ASVs) have many applications in both military and civilian domains including mine countermeasure, seafloor mapping, and physical oceanography. However, to act as effective tools, ASVs require high levels of autonomy. Currently, many commercially available ASVs have static mission plans with minimal awareness of their environment, which results in a labor intensive approach that does not scale to management of multiple vehicles. In this research, ASV autonomy was increased through the development of an intelligent mission planner and a real-time obstacle avoidance system utilizing Electronic Nautical Charts (ENCs), which describe known hazards in the marine environment without suffering from the challenges of real-time sensor processing. A new algorithm called Depth-Based A* was developed as the mission planner, where the nominal A* search algorithm was expanded by utilizing a novel cost function that balances driving in the channel with taking the most direct route on an ENC-derived cost map. Although charted obstacles can typically be avoided through mission planners, there is still an advantage in having the code do this. However, since it enables even higher levels of autonomy (e.g., “go in this area, but avoid all known obstacles”) they must still be accounted for in real time as other behaviors (i.e., avoiding uncharted obstacles or vessels) might cause the ASV to deviate from the planned path. The reactive obstacle avoidance system developed in this research reorganizes the ENC into a quick-search database where ENC-based obstacles in the ASV’s proximity are determined and avoided. These algorithms were tested with both a Seafloor System EchoBoat and ASV Global C-Worker 4 in simulation and in the field using an EchoBoat, where they avoided both concave and convex polygons. The algorithms developed in this research provide the ASV with a higher level of autonomy, potentially allowing for the same number of human operators to manage more ASVs

Autonomous Hybrid Ground/Aerial Mobility in Unknown Environments

Hybrid ground and aerial vehicles can possess distinct advantages over ground-only or flight-only designs in terms of energy savings and increased mobility. In this work we outline our unified framework for controls, planning, and autonomy of hybrid ground/air vehicles. Our contribution is three-fold: 1) We develop a control scheme for the control of passive two-wheeled hybrid ground/aerial vehicles. 2) We present a unified planner for both rolling and flying by leveraging differential flatness mappings. 3) We conduct experiments leveraging mapping and global planning for hybrid mobility in unknown environments, showing that hybrid mobility uses up to five times less energy than flying only