Real Time Edge Follow A New Paradigm to Real Time Path Search

Date

2001-01-01

Author

Undeger, Cagatay
Polat, Faruk
Ipekkan, Ziya

Metadata

Show full item record

Item Usage Stats

70
views

0
downloads

Path searching and mission planning are challenging problems in many domains such as war games, robotics, military mission planning, computer-generated forces, etc. The objective of this study is to develop a real-time pathplanning algorithm to accomplish specified missions on large landscapes. For that purpose, a real-time goaldirected path search algorithm, Real-Time Edge Follow (RTEF), which can work on fully known, partial known or completely unknown maze environments, is developed. RTEF aims to find a path from a staring point to a static or dynamic target point in real-time. The basic idea behind the RTEF is to let the agent eliminate closed directions (the directions that cannot reach the target point) by analyzing obstacle edges in order to decide on which way to go (open directions). For instance, if the agent has a chance to realize that moving to north and east won’t let him reach the goal state (although the target is at north-east), then he will prefer going to south or west. RTEF finds out these open and closed directions, so decreasing the number of choices the agent has and significantly shortening the path. The method is tested on large mazes and compared with Real-Time A*. We observed that RTEF always performs much better than RTA* when solution quality is considered and usually better when total time spent to reach the goal state is considered (especially on complicated mazes). RTEF frequently gives high solution quality, which is in most cases near to optimal solution, and never needs to return to a previously visited cell while on the way.

Subject Keywords

Computer-generated forces, Real-time path search, Maze problems

URI

https://hdl.handle.net/11511/78385

Conference Name

2nd International Conference on Intelligent Games and Simulation (GAME-ON 2001), (November 30 - December 1, 2001)

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

MOD* Lite: An Incremental Path Planning Algorithm Taking Care of Multiple Objectives Oral, Tugcem; Polat, Faruk (2016-01-01) The need for determining a path from an initial location to a target one is a crucial task in many applications, such as virtual simulations, robotics, and computer games. Almost all of the existing algorithms are designed to find optimal or suboptimal solutions considering only a single objective, namely path length. However, in many real life application path length is not the sole criteria for optimization, there are more than one criteria to be optimized that cannot be transformed to each other. In this...
Scenario management practices in HLA based distributed simulation Topçu, Okan; Oğuztüzün, Mehmet Halit S. (2010-04-01) Training in a distributed simulation generally involves carefully designed and constructed simulation scenarios to fulfill the training aims. The simulation scenarios (i.e. federation scenario) play an important role in the federation design and development as specified in Federation Development and Execution Process. The simulation scenarios are used in every step in distributed simulation arena from the beginning (analysis and design) of a distributed simulation development to the execution. Such an exten...
A simulation study of ad hoc networking of UAVs with opportunistic resource utilization networks Lilien, Leszek T.; BEN OTHMANE, Lotfi; Angın, Pelin; DECARLO, Andrew; Salih, Raed M.; BHARGAVA, Bharat (Elsevier BV, 2014-02-01) Specialized ad hoc networks of unmanned aerial vehicles (UAVs) have been playing increasingly important roles in applications for homeland defense and security. Common resource virtualization techniques are mainly designed for stable networks; they fall short in providing optimal performance in more dynamic networks such as mobile ad hoc networks (MANETs)-due to their highly dynamic and unstable nature. We propose application of Opportunistic Resource Utilization Networks (Oppnets), a novel type of MANETs, ...
Dynamic model integration and 3d graphical interface for a virtual ship Çalargün, Canku Alp; Oğuztüzün, Mehmet Halit S.; Department of Computer Engineering (2008) This thesis addresses the improvement of a physically based modeling simulator Naval Surface Tactical Maneuvering Simulation System (NSTMSS), that combines different simulators in a distributed environment by the help of High Level Architecture (HLA), to be used in naval tactical training systems. The objective is to upgrade a computer simulation program in which physical models are improved in order to achieve a more realistic movement of a ship in a virtual environment. The simulator will also be able to ...
An ontology for trajectory simulation Durak, Umut; Oğuztüzün, Mehmet Halit S.; Ider, S. Kemal (2006-12-06) From the concept exploration for a weapon system to training simulators, from hardware-in-the-loop simulators to mission planning tools, trajectory simulations are used throughout the life cycle of a weapon system. A trajectory simulation can be defined as a computational tool to calculate the flight path and flight parameters of munitions. There is a wide span of trajectory simulations differing widely with respect to their performance and fidelity characteristics, from simple point-mass simulations to six...

Citation Formats

C. Undeger, F. Polat, and Z. Ipekkan, “Real Time Edge Follow A New Paradigm to Real Time Path Search,” presented at the 2nd International Conference on Intelligent Games and Simulation (GAME-ON 2001), (November 30 - December 1, 2001), London, UK, 2001, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/78385.