Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kentaro Tokusei

dblp:98/126 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Robot navigation and mapping · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping › localization
landmark-based localization
0.011995
Design of the Optimal Arrangement of Artificial Landmarke · ICRA 1995
Algorithmic game theory and mechanism design › pricing
spatial competition
0.011995
Design of the Optimal Arrangement of Artificial Landmarke · ICRA 1995

Methods — techniques the papers use, named apart from their topics

spatial competition algorithm · 0.0simulation · 0.0
YearPublicationVenuePosition
1995 Design of the Optimal Arrangement of Artificial Landmarke
abstract
It is important to set landmarks when a robot needs to navigate in a certain environment and to measure its own location; however, it has not been discussed well how to arrange landmarks in the optimal way until now. We, therefore, demonstrate the possibility of design of the optimal arrangement of artificial landmarks. First, we make it clear the optimization problem with regard to the arrangement of landmarks. Second, as one example of the artificial landmarks, we introduce a signboard system. Third, we propose a methodology to evaluate arrangement of landmarks assuming an obstacled rectangular environment. Fourth, we apply the algorithm of spatial competition to the optimal arrangement of landmarks. Finally, simulation results indicate that even though our method is not global optimization approach we can obtain closely optimal and practical arrangement with the minimum number of landmarks which satisfies the necessary condition.
Craig Becker, Joaquín Salas, Kentaro Tokusei, Jean-Claude Latombe
ICRA3