Path-connecting multi-agent real-time a-star search

Download
114976.pdf
2001
Kaplan, Mustafa Kemal
Show full item record
52
views
0
downloads
https://hdl.handle.net/11511/11490
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Path Following with An Underactuated Self-Balancing Spherical-Wheel Mobile Robot
Inal, Ali Nail; Morgul, Omer; Saranlı, Uluç (2015-07-31)
Reactive methods for motion planning offer robustness advantages in the presence of large disturbances for robotic systems. Unfortunately, it is difficult to generalize these reactive methods to underactuated systems and existing research predominantly focuses on solutions based on the high-gain tracking of dynamically feasible trajectories. Self-balancing mobile robots with spherical wheels, BallBot platforms, are rich examples of such underactuated mechanisms where motion planning has traditionally been d...
PATH-INTEGRAL FOR SPIN - A NEW APPROACH
Alıyev, Tahmasıb; PAK, NK (1994-10-31)
The path integral representation for the propagator of a Dirac particle in an external electromagnetic field is derived using the functional derivative formalism with the help of Weyl symbol representation for the Grassmann vector part of the variables. The proposed method simplifies the proof of the path integral representation starting from the equation for the Green function significantly and automatically leads to a precise and unambiguous set of boundary conditions for the anticommuting variables and p...
Path planning for mobile-anchor based wireless sensor network localization: Static and dynamic schemes
Erdemir, Ecenaz; Tuncer, Temel Engin (Elsevier BV, 2018-08-01)
In wireless sensor networks, node locations are required for many applications. Usually, anchors with known positions are employed for localization. Sensor positions can be estimated more efficiently by using mobile anchors (MAs). Finding the best MA trajectory is an important problem in this context. Various path planning algorithms are proposed to localize as many sensors as possible by following the shortest path with minimum number of anchors. In this paper, path planning algorithms for MA assisted loca...
Path verification in software-defined networks using programmable data planes
Bostan, Hakan; Onur, Ertan; Department of Computer Engineering (2022-1)
Software-Defined Networks (SDNs) revamp the traditional network architectures by segregating the data plane and control plane and introducing a programmable and log- ically centralized control plane. Although SDNs bring along extensive improvements, as well as solutions to some of the network security problems, the security of SDN itself is often overlooked. Especially the security of the data plane is often overlooked because of the widespread assumption that the data plane devices are trusted. How- ever, ...
Path planning for mobile DCs in future cities
Al-Turjman, Fadi; Karakoc, Mehmet; GÜNAY, MELİH (2017-04-01)
In future smart-cities, public transportation vehicles are planned to serve as data couriers (DCs) in order to exchange massive amounts of data chunks. In this research, we study the path planning problem for these DCs while optimizing their counts and their total traveled distances. As the total collected load on a given DC route cannot exceed its storage capacity, it is important to decide on the size of the exchanged data-packets (images, videos, etc.) and the sequence of the targeted data sources to be ...
Citation Formats
M. K. Kaplan, “Path-connecting multi-agent real-time a-star search,” Middle East Technical University, 2001.
METU IIS - Integrated Information Service open@metu.edu.tr