Optimal Paths for Mutually Visible Agents

2005 ◽  
pp. 869-881
Author(s):  
Joel Fenwick ◽  
V. Estivill-Castro
Keyword(s):  
Optimal Paths

scholarly journals R-DFS: A Coverage Path Planning Approach Based on Region Optimal Decomposition

2021 ◽  
Vol 13 (8) ◽  
pp. 1525
Author(s):  
Gang Tang ◽  
Congqiang Tang ◽  
Hao Zhou ◽  
Christophe Claramunt ◽  
Shaoyang Men
Keyword(s):  
Path Planning ◽  
Google Earth ◽  
Simulation Experiments ◽  
Minimum Width ◽  
Coverage Path Planning ◽  
Optimal Paths ◽  
Planning Approach ◽  
Polygonal Area ◽  
Aerial Vehicle ◽  
Working Distance

Most Coverage Path Planning (CPP) strategies based on the minimum width of a concave polygonal area are very likely to generate non-optimal paths with many turns. This paper introduces a CPP method based on a Region Optimal Decomposition (ROD) that overcomes this limitation when applied to the path planning of an Unmanned Aerial Vehicle (UAV) in a port environment. The principle of the approach is to first apply a ROD to a Google Earth image of a port and combining the resulting sub-regions by an improved Depth-First-Search (DFS) algorithm. Finally, a genetic algorithm determines the traversal order of all sub-regions. The simulation experiments show that the combination of ROD and improved DFS algorithm can reduce the number of turns by 4.34%, increase the coverage rate by more than 10%, and shorten the non-working distance by about 29.91%. Overall, the whole approach provides a sound solution for the CPP and operations of UAVs in port environments.

scholarly journals Adiabatic landscape and optimal paths in ergodic systems

2021 ◽  
Vol 3 (1) ◽  
Author(s):  
Sho Sugiura ◽  
Pieter W. Claeys ◽  
Anatoly Dymarsky ◽  
Anatoli Polkovnikov
Keyword(s):  
Optimal Paths

Analysis of Stakeholders’ Behaviors in the Development of China’s Wind Power Industry

2014 ◽  
Vol 1070-1072 ◽  
pp. 187-192
Author(s):  
Chang Xin Xu ◽  
Jian Ting Lin ◽  
Yin Lu
Keyword(s):  
Game Theory ◽  
Wind Power ◽  
Price Policy ◽  
Power Industry ◽  
Incentive Policy ◽  
Optimal Paths ◽  
Key Issues ◽  
Wind Power Industry ◽  
And Behaviors

Based on the background of structural overcapacity in wind power industry, this paper analyzes the stakeholders’ motivations and behaviors. With game theory, wind power feed-in, tax concessions and other key issues are discussed. Then this paper puts forward some optimal paths from government strategy, determination and allocation price policy and incentive policy, which provide theoretical guidance and practical value to achieve the overall development of wind power industry.

Towards a Multi Objective Path Optimisation for Car Navigation

2011 ◽  
Vol 65 (1) ◽  
pp. 125-144 ◽  
Author(s):  
Ching-Sheng Chiu ◽  
Chris Rizos
Keyword(s):  
Selection Criteria ◽  
Empirical Studies ◽  
Route Selection ◽  
Multi Objective ◽  
Optimal Paths ◽  
Proposed Model ◽  
Shortest Distance ◽  
Shortest Path Algorithms ◽  
Car Navigation System ◽  
Car Navigation

In a car navigation system the conventional information used to guide drivers in selecting their driving routes typically considers only one criterion, usually the Shortest Distance Path (SDP). However, drivers may apply multiple criteria to decide their driving routes. In this paper, possible route selection criteria together with a Multi Objective Path Optimisation (MOPO) model and algorithms for solving the MOPO problem are proposed. Three types of decision criteria were used to present the characteristics of the proposed model. They relate to the cumulative SDP, passed intersections (Least Node Path – LNP) and number of turns (Minimum Turn Path – MTP). A two-step technique which incorporates shortest path algorithms for solving the MOPO problem was tested. To demonstrate the advantage that the MOPO model provides drivers to assist in route selection, several empirical studies were conducted using two real road networks with different roadway types. With the aid of a Geographic Information System (GIS), drivers can easily and quickly obtain the optimal paths of the MOPO problem, despite the fact that these paths are highly complex and difficult to solve manually.

On the smoothness of optimal paths

2004 ◽  
Vol 27 (1) ◽  
pp. 1-34 ◽  
Author(s):  
Joël Blot ◽  
Bertrand Crettez
Keyword(s):  
Optimal Paths

scholarly journals Hippocampal place cells use vector computations to navigate

2021 ◽  
Author(s):  
Jake Ormond ◽  
John O'Keefe
Keyword(s):  
Spatial Representation ◽  
Vector Fields ◽  
Cell Activity ◽  
Choice Point ◽  
Place Cell ◽  
Place Cells ◽  
Population Vector ◽  
Goal Location ◽  
Optimal Paths ◽  
Independent Assessment

One function of the Hippocampal Cognitive Map is to provide information about salient locations in familiar environments such as those containing reward or danger, and to support navigation towards or away from those locations. Although much is known about how the hippocampus encodes location in world-centred coordinates, how it supports flexible navigation is less well understood. We recorded from CA1 place cells while rats navigated to a goal or freely foraged on the honeycomb maze. The maze tests the animal's ability to navigate using indirect as well as direct paths to the goal and allows the directionality of place cells to be assessed at each choice point during traversal to the goal. Place fields showed strong directional polarization in the navigation task, and to a lesser extent during random foraging. This polarization was characterized by vector fields which converged to sinks distributed throughout the environment. The distribution of these convergence sinks was centred near the goal location, and the population vector field converged on the goal, providing a strong navigational signal. Changing the goal location led to the movement of ConSinks and vector fields towards the new goal and within-days, the ConSink distance to the goal decreased with continued training. The honeycomb maze allows the independent assessment of spatial representation and spatial action in place cell activity and shows how the latter depends on the former. The results suggest a vector-based model of how the hippocampus supports flexible navigation, allowing animals to select optimal paths to destinations from any location in the environment.

scholarly journals The Number of Moves of the Largest Disc in Shortest Paths on Hanoi Graphs

10.37236/4252 ◽  
2014 ◽  
Vol 21 (4) ◽  
Author(s):  
Simon Aumann ◽  
Katharina A.M. Götz ◽  
Andreas M. Hinz ◽  
Ciril Petr
Keyword(s):  
Shortest Paths ◽  
General Setting ◽  
Optimal Number ◽  
Numerical Results ◽  
Breadth First Search ◽  
Tower Of Hanoi ◽  
Optimal Paths ◽  
Widespread Interest ◽  
Binary Strings

In contrast to the widespread interest in the Frame-Stewart conjecture (FSC) about the optimal number of moves in the classical Tower of Hanoi task with more than three pegs, this is the first study of the question of investigating shortest paths in Hanoi graphs $H_p^n$ in a more general setting. Here $p$ stands for the number of pegs and $n$ for the number of discs in the Tower of Hanoi interpretation of these graphs. The analysis depends crucially on the number of largest disc moves (LDMs). The patterns of these LDMs will be coded as binary strings of length $p-1$ assigned to each pair of starting and goal states individually. This will be approached both analytically and numerically. The main theoretical achievement is the existence, at least for all $n\geqslant p(p-2)$, of optimal paths where $p-1$ LDMs are necessary. Numerical results, obtained by an algorithm based on a modified breadth-first search making use of symmetries of the graphs, lead to a couple of conjectures about some cases not covered by our ascertained results. These, in turn, may shed some light on the notoriously open FSC.

Sign in / Sign up

Export Citation Format

Share Document