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
Dynamic Obstacle-Avoidance Algorithm for Multi-Robot Flocki..:
Shao, Shiliang
;
Zhang, Jin
;
Wang, Ting
..
IEEE Transactions on Consumer Electronics. 70 (2024) 1 - p. 4388-4399 , 2024
Link:
https://doi.org/10.1109/tce.2023.3340327
RT Journal T1 <Title>Dynamic Obstacle-Avoidance Algorithm for Multi-Robot Flocking Based on Improved Artificial Potential Field</Title> UL https://suche.suub.uni-bremen.de/peid=cr-10.1109_tce.2023.3340327&Exemplar=1&LAN=DE A1 Shao, Shiliang A1 Zhang, Jin A1 Wang, Ting A1 Shankar, Achyut A1 Maple, Carsten PB Institute of Electrical and Electronics Engineers (IEEE) YR 2024 SN 0098-3063 SN 1558-4127 JF IEEE Transactions on Consumer Electronics VO 70 IS 1 SP 4388 OP 4399 LK http://dx.doi.org/https://doi.org/10.1109/tce.2023.3340327 DO https://doi.org/10.1109/tce.2023.3340327 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
