Frank E. Schneider

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Mark Moors

> Home > Persons > Frank E. Schneider

Publications

2007
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/iros/HoellerSMS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iros/HoellerSMS07
Frank Hoeller, Dirk Schulz, Mark Moors, Frank E. Schneider:
Accompanying persons with a mobile robot using motion prediction and probabilistic roadmaps. IROS 2007: 1260-1265
2005
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/trob/BurgardMSS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/trob/BurgardMSS05
Wolfram Burgard, Mark Moors, Cyrill Stachniss, Frank E. Schneider:
Coordinated multi-robot exploration. IEEE Trans. Robotics 21(3): 376-386 (2005)
2004
[c8]
- view
  authority control:
- export record
  dblp key:
  - conf/icra/SchneiderWM04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icra/SchneiderWM04
Frank E. Schneider, Dennis Wildermuth, Mark Moors:
Methods and Experiments for Hazardous Area Activities using a Multi-robot System. ICRA 2004: 3559-3564
2001
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/dagstuhl/BurgardMS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/BurgardMS01
Wolfram Burgard, Mark Moors, Frank E. Schneider:
Collaborative Exploration of Unknown Environments with Teams of Mobile Robots. Advances in Plan-Based Control of Robotic Agents 2001: 52-70

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.