A framed-quadtree approach for determining Euclidean shortest paths in a 2-D environment

Chen, D.Z.; Szczerba, Robert J.; Uhran, John J.

doi:10.1109/70.631228

Cited by 73 publications

(25 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Izvor: (Chen, Szczerba, & Uhran, 1997) Algoritam planiranja kretanja (MP) 4 se sastoji iz nekoliko koraka: U prvom koraku obrađuju se podaci iz 3D prikaza simulacionog modela i sastavlja se struktura podataka koja se dalje koristi za automatsko izračunavanje mogućih putanja. Svaki put kada korisnik modifikuje simulacioni model, obrada statističkog prikaza 1 Siemens Plant simulation (Simensova simulacija postrojenja) je simulaciona metoda bazirana na diskretnim događajima, koji pomažu da se formira simulacioni model intralogističkog sistema, tako da se mogu iskazati karakteristike sistema i vršiti optimizacija njegovih performansi.…”

Section: Slika 1 Tok Radnje Modeliranja Simulacije I Analizeunclassified

Simulations in Material Flows Planning in Warehouses

Maletić¹,

Čekerevac²

2017

FBIM Transactions

View full text Add to dashboard Cite

show abstract

Section: Slika 1 Tok Radnje Modeliranja Simulacije I Analizeunclassified

Simulations in Material Flows Planning in Warehouses

Maletić¹,

Čekerevac²

2017

FBIM Transactions

View full text Add to dashboard Cite

show abstract

“…Possible approaches include Voronoi diagrams [2] and PRM [21]. We follow Chen et al [5] and construct a graph using quad tree decomposition of the space, exploring it with an extended version of the Dijkstra algorithm. The generation of our quad tree is specific for its application to structured indoor spaces, with large rooms connected through corridors, doors and passageways and where each room may contain such things as counters, shelves and exhibition paraphernalia that compromise its regularity.…”

Section: Graph Based Methodsmentioning

confidence: 99%

“…These projects are based on a substantial involvement with users, both for requirements collection and for the evaluation of the results. The algorithm proposed here distils this experience and translates it into a suitable formal model by using a modified Dijkstra's shortest path algorithm [11] where the underlying graph is constructed using quad tree decomposition of the free space [5].…”

Section: Introductionmentioning

confidence: 99%

Efficient customisable dynamic motion planning for assistive robots in complex human environments

Colombo

Fontanelli

Legay

et al. 2015

AIS

View full text Add to dashboard Cite

Abstract. People with impaired physical and mental ability often find it challenging to negotiate crowded or unfamiliar environments, leading to a vicious cycle of deteriorating mobility and sociability. To address this issue we present a novel motion planning algorithm that is able to intelligently deal with crowded areas, permanent or temporary anomalies in the environment (e.g., road blocks, wet floors) as well as hard and soft constraints (e.g., "keep a toilet within reach of 10 meters during the journey", "always avoid stairs"). Constraints can be assigned a priority tailored on the user's needs. The planner has been validated by means of simulations and experiments with elderly people within the context of the DALi European project.

show abstract

“…In the latter case, local view of the environment and the obstacles is obtained and the path planning is performed using the local information obtained with the help of some sensing device. The traditional algorithms used for path planning have certain limitations such as low search efficiency, complex search paths, large convergence time and trap into local maxima [3][4][5][6][7][8]. So the interest of researchers switched to intelligent algorithms which are proven to be much better than classical approaches.…”

Section: Introductionmentioning

confidence: 99%

Efficient ABC Algorithm for Dynamic Path Planning

Goel¹,

Singh²

2014

IJCA

View full text Add to dashboard Cite

The path planning of mobile robot is an important issue in the field of robotics. Many algorithms have been designed to solve the path planning problem, including classical as well as intelligent approaches. The main aim of path planning is to construct collision free path from a specified start position to the target position. Moreover, the path should be optimal in some context such as distance, time or processing. This paper presents an efficient algorithm which is a variation of artificial bee colony algorithm. The environment modelled is in the form of grid consisting of obstacles. The algorithm works on two problems-the first problem is to find collision free path in the presence of static obstacles and the second problem is to determine shortest collision free path in the presence of dynamic obstacles.

show abstract

A framed-quadtree approach for determining Euclidean shortest paths in a 2-D environment

Cited by 73 publications

References 5 publications

Simulations in Material Flows Planning in Warehouses

Simulations in Material Flows Planning in Warehouses

Efficient customisable dynamic motion planning for assistive robots in complex human environments

Efficient ABC Algorithm for Dynamic Path Planning

Contact Info

Product

Resources

About