Shortest paths for finned, winged, legged, and wheeled vehicles with side-looking sensors

2012 ◽  
Vol 31 (8) ◽  
pp. 997-1017 ◽  
Author(s):  
Paolo Salaris ◽  
Lucia Pallottino ◽  
Antonio Bicchi
2019 ◽  
Author(s):  
Ruslan N. Tazhigulov ◽  
James R. Gayvert ◽  
Melissa Wei ◽  
Ksenia B. Bravaya

<p>eMap is a web-based platform for identifying and visualizing electron or hole transfer pathways in proteins based on their crystal structures. The underlying model can be viewed as a coarse-grained version of the Pathways model, where each tunneling step between hopping sites represented by electron transfer active (ETA) moieties is described with one effective decay parameter that describes protein-mediated tunneling. ETA moieties include aromatic amino acid residue side chains and aromatic fragments of cofactors that are automatically detected, and, in addition, electron/hole residing sites that can be specified by the users. The software searches for the shortest paths connecting the user-specified electron/hole source to either all surface-exposed ETA residues or to the user-specified target. The identified pathways are ranked based on their length. The pathways are visualized in 2D as a graph, in which each node represents an ETA site, and in 3D using available protein visualization tools. Here, we present the capability and user interface of eMap 1.0, which is available at https://emap.bu.edu.</p>


Author(s):  
Mark Newman

This chapter introduces some of the fundamental concepts of numerical network calculations. The chapter starts with a discussion of basic concepts of computational complexity and data structures for storing network data, then progresses to the description and analysis of algorithms for a range of network calculations: breadth-first search and its use for calculating shortest paths, shortest distances, components, closeness, and betweenness; Dijkstra's algorithm for shortest paths and distances on weighted networks; and the augmenting path algorithm for calculating maximum flows, minimum cut sets, and independent paths in networks.


2001 ◽  
Vol 110 (2-3) ◽  
pp. 151-167 ◽  
Author(s):  
Danny Z. Chen ◽  
Gautam Das ◽  
Michiel Smid

2021 ◽  
Vol 52 (2) ◽  
pp. 121-132
Author(s):  
Richard Goldstone ◽  
Rachel Roca ◽  
Robert Suzzi Valli
Keyword(s):  

2021 ◽  
Vol 11 (12) ◽  
pp. 5490
Author(s):  
Anna Maria Gargiulo ◽  
Ivan di Stefano ◽  
Antonio Genova

The exploration of planetary surfaces with unmanned wheeled vehicles will require sophisticated software for guidance, navigation and control. Future missions will be designed to study harsh environments that are characterized by rough terrains and extreme conditions. An accurate knowledge of the trajectory of planetary rovers is fundamental to accomplish the scientific goals of these missions. This paper presents a method to improve rover localization through the processing of wheel odometry (WO) and inertial measurement unit (IMU) data only. By accurately defining the dynamic model of both a rover’s wheels and the terrain, we provide a model-based estimate of the wheel slippage to correct the WO measurements. Numerical simulations are carried out to better understand the evolution of the rover’s trajectory across different terrain types and to determine the benefits of the proposed WO correction method.


Sign in / Sign up

Export Citation Format

Share Document