hCHAC-4, an ACO Algorithm for Solving the Four-Criteria Military Path-finding Problem

2008 ◽  
pp. 73-84 ◽  
Author(s):  
A. M. Mora ◽  
J. J. Merelo ◽  
J. L. J. Laredo ◽  
P. A. Castillo ◽  
P. G. Sánchez ◽  
...  
Keyword(s):  
Path Finding

A Path Finding Heuristic Algorithm for A Road Network Hierarchy

2009 ◽  
Vol 11 (2) ◽  
pp. 151-156 ◽  
Author(s):  
Song GAO ◽  
Feng LU
Keyword(s):  
Heuristic Algorithm ◽  
Road Network ◽  
Path Finding ◽  
Network Hierarchy

A Loop-Free Path-Finding Algorithm: Specification, Verification and Complexity

1995 ◽  
Author(s):  
J. J. Garcia-Luna-Aceves ◽  
Shree Murthy
Keyword(s):  
Free Path ◽  
Path Finding

Hybrid Meet-in-the-Middle Attacks for the Isogeny Path-Finding Problem

2020 ◽  
Author(s):  
Yasuhiko Ikematsu ◽  
Ryoya Fukasaku ◽  
Momonari Kudo ◽  
Masaya Yasuda ◽  
Katsuyuki Takashima ◽  
...  
Keyword(s):  
Path Finding

A Lyapunov Analysis of a Most Probable Path Finding Algorithm

2021 ◽  
pp. 1-1
Author(s):  
Yuanqiu Mo ◽  
Soura Dasgupta ◽  
Jacob Beal
Keyword(s):  
Lyapunov Analysis ◽  
Path Finding ◽  
Probable Path ◽  
Most Probable Path

Indoor landmark-based path-finding utilising the expanded connectivity of an endpoint partition

2016 ◽  
Vol 45 (2) ◽  
pp. 233-252
Author(s):  
Pepijn Viaene ◽  
Alain De Wulf ◽  
Philippe De Maeyer
Keyword(s):  
Visual Information ◽  
Spatial Configuration ◽  
Shortest Paths ◽  
Minimal Amount ◽  
Path Finding ◽  
Breadth First Search ◽  
Length Increase ◽  
Efficient Communication ◽  
Indoor Wayfinding

Landmarks are ideal wayfinding tools to guide a person from A to B as they allow fast reasoning and efficient communication. However, very few path-finding algorithms start from the availability of landmarks to generate a path. In this paper, which focuses on indoor wayfinding, a landmark-based path-finding algorithm is presented in which the endpoint partition is proposed as spatial model of the environment. In this model, the indoor environment is divided into convex sub-shapes, called e-spaces, that are stable with respect to the visual information provided by a person’s surroundings (e.g. walls, landmarks). The algorithm itself implements a breadth-first search on a graph in which mutually visible e-spaces suited for wayfinding are connected. The results of a case study, in which the calculated paths were compared with their corresponding shortest paths, show that the proposed algorithm is a valuable alternative for Dijkstra’s shortest path algorithm. It is able to calculate a path with a minimal amount of actions that are linked to landmarks, while the path length increase is comparable to the increase observed when applying other path algorithms that adhere to natural wayfinding behaviour. However, the practicability of the proposed algorithm is highly dependent on the availability of landmarks and on the spatial configuration of the building.

Minimum-cost spanning tree as a path-finding problem

1988 ◽  
Vol 26 (6) ◽  
pp. 291-293 ◽  
Author(s):  
Bruce M. Maggs ◽  
Serge A. Plotkin
Keyword(s):  
Spanning Tree ◽  
Minimum Cost ◽  
Path Finding

A path finding method for constraint checking in deductive databases

1989 ◽  
Vol 4 (3) ◽  
pp. 223-244 ◽  
Author(s):  
Subrata K. Das ◽  
M. Howard Williams
Keyword(s):  
Deductive Databases ◽  
Path Finding ◽  
Constraint Checking ◽  
Finding Method
Sign in / Sign up

Export Citation Format

Share Document