Research into Autonomous Vehicles Following and Obstacle Avoidance Based on Deep Reinforcement Learning Method under Map Constraints

Autor: Zheng Li, Shihua Yuan, Xufeng Yin, Xueyuan Li, Shouxing Tang

Publikováno v: Sensors, Vol 23, Iss 2, p 844 (2023)

Compared with traditional rule-based algorithms, deep reinforcement learning methods in autonomous driving are able to reduce the response time of vehicles to the driving environment and fully exploit the advantages of autopilot. Nowadays, autonomous

Externí odkaz: https://doaj.org/article/cb3b2fa074844cb68074e26f3aebf6cf

Forces et paradoxes des dynamiques dites « inclusives » : Étude auprès d’enseignants en formation à l’École inclusive

Autor: Mercier, Cendrine, Lefer-Sauvage, Gaëlle

Publikováno v: Éducation et socialisation.

L’école inclusive qui est un jeune paradigme toujours en construction a besoin de temps pour s’installer progressivement sur le terrain de l’école et les pratiques pédagogiques. Au travers des parcours des stagiaires au CAPPEI, il est possib

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca3e2f497137b7acc2836c46385299d6
https://doi.org/10.4000/edso.20814

Bounding and Computing Obstacle Numbers of Graphs

Autor: Balko, Martin, Chaplick, Steven, Ganian, Robert, Gupta, Siddharth, Hoffmann, Michael, Valtr, Pavel, Wolff, Alexander

Publikováno v: 30th Annual European Symposium on Algorithms, {ESA} 2022,: September 5-9, 2022, Berlin/Potsdam, Germany, 244, 11:1-11:13
Leibniz International Proceedings in Informatics (LIPIcs), 244
30th Annual European Symposium on Algorithms (ESA 2022)
Annual European Symposium on Algorithms

An obstacle representation of a graph G consists of a set of pairwise disjoint simply-connected closed regions and a one-to-one mapping of the vertices of G to points such that two vertices are adjacent in G if and only if the line segment connecting

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c558a36d80a313b9591fb3e73bf5db8
https://cris.maastrichtuniversity.nl/en/publications/8c621dad-a8bb-4de2-a819-490904356dda

Geodesic obstacle representation of graphs

Autor: Prosenjit Bose, Paz Carmi, Vida Dujmović, Saeed Mehrabi, Fabrizio Montecchiani, Pat Morin, Luís Fernando Schultz Xavier da Silveira

An obstacle representation of a graph is a mapping of the vertices onto points in the plane and a set of connected regions of the plane (called obstacles) such that the straight-line segment connecting the points corresponding to two vertices does no

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b0d9ecc1ed3cae223bb3b694fd4f0130
http://hdl.handle.net/11391/1439153

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.