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

Maitreyi Nanjanath

dblp:36/4744 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-authorSystems, architecture and hardware · 2 · 2 first-author

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
Multi-agent systems · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Multi-agent systems › task allocation › multi-robot task allocation
auction-based allocation
0.112006
Dynamic Task Allocation for Robots via Auctions · ICRA 2006
Knowledge, reasoning and agents › Multi-agent systems › task allocation
multi-robot task allocation
0.112006
Dynamic Task Allocation for Robots via Auctions · ICRA 2006
Distributed systems
distributed coordination
0.012006
Dynamic Task Allocation for Robots via Auctions · ICRA 2006
Distributed systems › distributed scheduling
task reallocation
0.012006
Dynamic Task Allocation for Robots via Auctions · ICRA 2006

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

simulation · 0.1auction mechanism · 0.1
YearPublicationVenuePosition
2006 Dynamic Task Allocation for Robots via Auctions
abstract
We present an auction-based method for the allocation of tasks to a group of robots. The robots operate in a 2D environment for which they have a map. Tasks are locations in the map that have to be visited by the robots. Unexpected obstacles and other delays may prevent a robot from being able to complete its allocated tasks. Therefore tasks not yet achieved are rebid every time a robot accomplishes a task. This provides an opportunity to improve the allocation of the remaining tasks and to reduce the overall task completion time. We present experimental results that we have obtained in simulation using Player/Stage with this task allocation mechanism
Maitreyi Nanjanath, Maria L. Gini
ICRA1
2004 Scale estimation for robots in urban search and rescue
abstract
Urban search and rescue (USAR) is the rescue of people trapped by disasters involving the collapse of man-made structures. Introducing robots to USAR has the potential to increase the speed and effectiveness of rescue operations considerably and make them safer for rescuers. Robots have been used in recent rescue operations, including the WTC terrorist attack, leading to the identification of several problems in robot-assisted search and rescue. This paper proposes a solution to one such problem that has been encountered repeatedly in the use of robots for USAR: the determination of the scale of unrecognizable objects in the camera views from the robot. We describe a procedure that would allow the extraction of size and orientation information using a laser pointer and camera mounted on a robot, and experiments that verify the effectiveness of this procedure have been shown.
Maitreyi Nanjanath, Richard A. Volz
IROS1