Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Itsuki Noda

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 Hidehisa Akiyama

> Home > Persons > Itsuki Noda

Publications

2011
[j11]
- view
  authority control:
- export record
  dblp key:
  - journals/jfr/NagataniOTKYOTTANYK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jfr/NagataniOTKYOTTANYK11
Keiji Nagatani, Yoshito Okada, Naoki Tokunaga, Seiga Kiribayashi, Kazuya Yoshida, Kazunori Ohno, Eijiro Takeuchi, Satoshi Tadokoro, Hidehisa Akiyama, Itsuki Noda, Tomoaki Yoshida, Eiji Koyanagi:
Multirobot exploration for search and rescue missions: A report on map building in RoboCupRescue 2009. J. Field Robotics 28(3): 373-387 (2011)
2008
[c47]
- view
  authority control:
- export record
  dblp key:
  - conf/simpar/NodaSA08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/simpar/NodaSA08
Itsuki Noda, Hiroki Shimora, Hidehisa Akiyama:
Conceptual Framework to Maintain Multiple and Floating Relationship among Coordinate Reference Systems for Robotics. SIMPAR 2008: 328-339
2007
[c45]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/robocup/AkiyamaN07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/robocup/AkiyamaN07
Hidehisa Akiyama, Itsuki Noda:
Multi-agent Positioning Mechanism in the Dynamic Environment. RoboCup 2007: 377-384

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.