SwePub
Sök i LIBRIS databas

  Utökad sökning

WFRF:(Peng Bile 1985)
 

Sökning: WFRF:(Peng Bile 1985) > Decentralized Sched...

Decentralized Scheduling for Cooperative Localization With Deep Reinforcement Learning

Peng, Bile, 1985 (författare)
Chalmers University of Technology, Sweden,Chalmers tekniska högskola
Seco-Granados, G. (författare)
Universitat Autonoma de Barcelona, Spain,Universitat Autonoma de Barcelona (UAB)
Steinmetz, Erik (författare)
RISE,Mätteknik,Chalmers University of Technology, Sweden,RISE Research Institutes of Sweden,Chalmers tekniska högskola
visa fler...
Fröhle, Markus, 1984 (författare)
Chalmers University of Technology, Sweden,Chalmers tekniska högskola
Wymeersch, Henk, 1976 (författare)
Chalmers University of Technology, Sweden,Chalmers tekniska högskola
visa färre...
 (creator_code:org_t)
Institute of Electrical and Electronics Engineers Inc. 2019
2019
Engelska.
Ingår i: IEEE Transactions on Vehicular Technology. - : Institute of Electrical and Electronics Engineers Inc.. - 0018-9545 .- 1939-9359. ; 68:5, s. 4295-4305
  • Tidskriftsartikel (refereegranskat)
Abstract Ämnesord
Stäng  
  • Cooperative localization is a promising solution to the vehicular high-accuracy localization problem. Despite its high potential, exhaustive measurement and information exchange between all adjacent vehicles are expensive and impractical for applications with limited resources. Greedy policies or hand-engineering heuristics may not be able to meet the requirement of complicated use cases. In this paper, we formulate a scheduling problem to improve the localization accuracy (measured through the Cramér-Rao lower bound) of every vehicle up to a given threshold using the minimum number of measurements. The problem is cast as a partially observable Markov decision process and solved using decentralized scheduling algorithms with deep reinforcement learning, which allow vehicles to optimize the scheduling (i.e., the instants to execute measurement and information exchange with each adjacent vehicle) in a distributed manner without a central controlling unit. Simulation results show that the proposed algorithms have a significant advantage over random and greedy policies in terms of both required numbers of measurements to localize all nodes and achievable localization precision with limited numbers of measurements.

Ämnesord

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Reglerteknik (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Control Engineering (hsv//eng)
TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Signalbehandling (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Signal Processing (hsv//eng)
NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)

Nyckelord

cooperative localization
deep Q-learning
deep reinforcement learning
Machine-learning for vehicular localization
policy gradient
Information dissemination
Learning algorithms
Machine learning
Markov processes
Reinforcement learning
Scheduling
Scheduling algorithms
Vehicles
Decentralized scheduling
Engineering heuristics
Information exchanges
Localization accuracy
Partially observable Markov decision process
Q-learning
Deep learning

Publikations- och innehållstyp

ref (ämneskategori)
art (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy