I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Coverage Path Planning for Autonomous Road Sweepers in Obst..:
, In:
2022 IEEE Conference on Control Technology and Applications (CCTA)
,
Yang, Niankai
;
Zhang, Weifan
;
Yu, Wenbo
- p. 491-497 , 2022
Link:
https://doi.org/10.1109/CCTA49430.2022.9966056
RT T1
2022 IEEE Conference on Control Technology and Applications (CCTA)
: T1
Coverage Path Planning for Autonomous Road Sweepers in Obstacle-cluttered Environments
UL https://suche.suub.uni-bremen.de/peid=ieee-9966056&Exemplar=1&LAN=DE A1 Yang, Niankai A1 Zhang, Weifan A1 Yu, Wenbo YR 2022 SN 2768-0770 K1 Uncertainty K1 Roads K1 Heuristic algorithms K1 Traveling salesman problems K1 Turning K1 Path planning K1 Cleaning SP 491 OP 497 LK http://dx.doi.org/https://doi.org/10.1109/CCTA49430.2022.9966056 DO https://doi.org/10.1109/CCTA49430.2022.9966056 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)