Evidence map›Paper›PMID 36772181›Full record

ArticleSensors (Basel, Switzerland)2023

Odor Source Localization in Obstacle Regions Using Switching Planning Algorithms with a Switching Framework.

Duc-Nhat Luong, Daisuke Kurabayashi

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 3 papers.

0numbers the graph read from it
0cells of the map it votes in
3citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

3 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Duc-Nhat LuongDepartment of Systems and Control Engineering, Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, Tokyo 152-8552, Japan.ORCID 0000-0002-6688-9514
Daisuke KurabayashiDepartment of Systems and Control Engineering, Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro-ku, Tokyo 152-8552, Japan.ORCID 0000-0002-3186-6531

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Odor source localization (OSL) robots are essential for safety and rescue teams to overcome the problem of human exposure to hazardous chemical plumes. However, owing to the complicated geometry of environments, it is almost impossible to construct the dispersion model of the odor plume in practical situations to be used for probabilistic odor source search algorithms. Additionally, as time is crucial in OSL tasks, dynamically modifying the robot's balance of emphasis between exploration and exploitation is desired. In this study, we addressed both the aforementioned problems by simplifying the environment with an obstacle region into multiple sub-environments with different resolutions. Subsequently, a framework was introduced to switch between the Infotaxis and Dijkstra algorithms to navigate the agent and enable it to reach the source swiftly. One algorithm was used to guide the agent in searching for clues about the source location, whereas the other facilitated the active movement of the agent between sub-environments. The proposed algorithm exhibited improvements in terms of success rate and search time. Furthermore, the implementation of the proposed framework on an autonomous mobile robot verified its effectiveness. Improvements were observed in our experiments with a robot when the success rate increased 3.5 times and the average moving steps of the robot were reduced by nearly 35%.

Indexed as

algorithm switchingodor source localizationolfactory robotplanning algorithm

Identifiers

PMID36772181
PMCPMC9920013

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.