Pretraga

Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 512879

Two-way D* algorithm for path planning and replanning

Đakulović, Marija; Petrović, Ivan
Two-way D* algorithm for path planning and replanning // Robotics and autonomous systems, 59 (2011), 5; 329-342 doi:10.1016/j.robot.2011.02.007 (međunarodna recenzija, članak, znanstveni)

CROSBI ID: 512879 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

Naslov
Two-way D* algorithm for path planning and replanning

Autori
Đakulović, Marija ; Petrović, Ivan

Izvornik
Robotics and autonomous systems (0921-8890) 59 (2011), 5; 329-342

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
Graph search; Path planning; Euclidean shortest path; Mobile robotics

Sažetak
Inspired by the Witkowski's algorithm, we introduce a novel path planning and replanning algorithm - the two-way D* (TWD*) algorithm - based on a two-dimensional occupancy grid map of the environment. Unlike the Witkowski's algorithm, which finds optimal paths only in binary occupancy grid maps, the TWD* algorithm can find optimal paths in weighted occupancy grid maps. The optimal path found by the TWD* algorithm is the shortest possible path for a given occupancy grid map of the environment. This path is more natural than the path found by the standard D* algorithm as it consists of straight line segments with continuous headings. The TWD* algorithm is tested and compared to the D* and Witkowski's algorithms by extensive simulations and experimentally on a Pioneer 3DX mobile robot equipped with a laser range finder.

Izvorni jezik
Engleski

Znanstvena područja
Elektrotehnika, Računarstvo, Temeljne tehničke znanosti



POVEZANOST RADA

Projekti:
036-0361621-3012 - Napredne strategije upravljanja i estimacije u složenim sustavima (Perić, Nedjeljko, MZO ) ( CroRIS)
036-0363078-3018 - Upravljanje mobilnim robotima i vozilima u nepoznatim i dinamičkim okruženjima (Petrović, Ivan, MZO ) ( CroRIS)

Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb

Profili:

Avatar Url Ivan Petrović (autor)

Poveznice na cjeloviti tekst rada:

doi www.sciencedirect.com pdn.sciencedirect.com dx.doi.org

Citiraj ovu publikaciju:

Đakulović, Marija; Petrović, Ivan
Two-way D* algorithm for path planning and replanning // Robotics and autonomous systems, 59 (2011), 5; 329-342 doi:10.1016/j.robot.2011.02.007 (međunarodna recenzija, članak, znanstveni)
Đakulović, M. & Petrović, I. (2011) Two-way D* algorithm for path planning and replanning. Robotics and autonomous systems, 59 (5), 329-342 doi:10.1016/j.robot.2011.02.007.
@article{article, author = {\DJakulovi\'{c}, Marija and Petrovi\'{c}, Ivan}, year = {2011}, pages = {329-342}, DOI = {10.1016/j.robot.2011.02.007}, keywords = {Graph search, Path planning, Euclidean shortest path, Mobile robotics}, journal = {Robotics and autonomous systems}, doi = {10.1016/j.robot.2011.02.007}, volume = {59}, number = {5}, issn = {0921-8890}, title = {Two-way D\ast algorithm for path planning and replanning}, keyword = {Graph search, Path planning, Euclidean shortest path, Mobile robotics} }
@article{article, author = {\DJakulovi\'{c}, Marija and Petrovi\'{c}, Ivan}, year = {2011}, pages = {329-342}, DOI = {10.1016/j.robot.2011.02.007}, keywords = {Graph search, Path planning, Euclidean shortest path, Mobile robotics}, journal = {Robotics and autonomous systems}, doi = {10.1016/j.robot.2011.02.007}, volume = {59}, number = {5}, issn = {0921-8890}, title = {Two-way D\ast algorithm for path planning and replanning}, keyword = {Graph search, Path planning, Euclidean shortest path, Mobile robotics} }

Časopis indeksira:


  • Current Contents Connect (CCC)
  • Web of Science Core Collection (WoSCC)
    • Science Citation Index Expanded (SCI-EXP)
    • SCI-EXP, SSCI i/ili A&HCI
  • Scopus

Citati:

    Altmetrijski pokazatelji:


    Podijeli:





    Contrast
    Increase Font
    Decrease Font
    Dyslexic Font
    CROSBI koristi kolačiće (cookies) kako bi poboljšao funkcionalnost stranice.