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
Design and Develop Optimal Pathfinding Algorithm Applied in..:
, In:
2022 6th International Conference on Green Technology and Sustainable Development (GTSD)
,
Huy, Vu Quang
;
Huy, Nguyen Tan
;
Duong, Pham Bach
. - p. 350-354 , 2022
Link:
https://doi.org/10.1109/GTSD54989.2022.9989272
RT T1 <cTitle>2022 6th International Conference on Green Technology and Sustainable Development (GTSD)</cTitle>: T1 <Title>Design and Develop Optimal Pathfinding Algorithm Applied in Book Accessing and Returning for Autonomous Mobile Robot in Library</Title> UL https://suche.suub.uni-bremen.de/peid=ieee-9989272&Exemplar=1&LAN=DE A1 Huy, Vu Quang A1 Huy, Nguyen Tan A1 Duong, Pham Bach A1 Ngoc Hai, Nam Truong YR 2022 K1 Visualization K1 Webcams K1 Software algorithms K1 Clustering algorithms K1 Evolutionary computation K1 Traveling salesman problems K1 Software K1 Robot Operating System K1 Pathfinding K1 Genetic Algorithms K1 K-means Clustering K1 Traveling Salesman Problem SP 350 OP 354 LK http://dx.doi.org/https://doi.org/10.1109/GTSD54989.2022.9989272 DO https://doi.org/10.1109/GTSD54989.2022.9989272 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
