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

Junnan Song

dblp:165/2270 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2020
0000-0003-0814-3447ORCID · corroborated

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

Computer networks · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 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
Robot navigation and mapping · 50% Motion planning and robot control · 25% Reinforcement learning · 25%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › path planning
coverage path planning
0.312018
ɛ*: An Online Coverage Path Planning Algorithm · IEEE Trans. Robotics 2018
Robotics › Robot navigation and mapping
mobile robot navigation
0.312018
ɛ*: An Online Coverage Path Planning Algorithm · IEEE Trans. Robotics 2018
Robotics › Robot navigation and mapping › coverage control
online coverage
0.312018
ɛ*: An Online Coverage Path Planning Algorithm · IEEE Trans. Robotics 2018
Machine learning › Reinforcement learning › exploration › autonomous exploration › mobile robot exploration
unknown environment exploration
0.312018
ɛ*: An Online Coverage Path Planning Algorithm · IEEE Trans. Robotics 2018

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

multiscale adaptive potential surfaces · 0.3exploratory turing machine · 0.3
YearPublicationVenuePosition
2020 POSE.R: Prediction-based Opportunistic Sensing for Resilient and Efficient Sensor Networks
abstract
The article presents a distributed algorithm, called Prediction-based Opportunistic Sensing for Resilient and Efficient Sensor Networks (POSE.R), where the sensor nodes utilize predictions of the targets' positions to probabilistically control their multi-modal operating states to track the targets. There are two desired features of the algorithm: energy efficiency and resilience. If the target is traveling through a high-node-density area, then an optimal sensor selection approach is employed that maximizes a joint cost function of remaining energy and geometric diversity around the target’s position. This provides energy efficiency and increases the network lifetime while preventing redundant nodes from tracking the target. However, if the target is traveling through a low-node-density area or in a coverage gap (e.g., formed by node failures or non-uniform node deployment), then a potential game is played amongst the surrounding nodes to optimally expand their sensing ranges via minimizing energy consumption and maximizing target coverage. This provides resilience, that is, the self-healing capability to track the target in the presence of low node densities and coverage gaps. The algorithm is comparatively evaluated against existing approaches through Monte Carlo simulations that demonstrate its superiority in terms of tracking performance, network-resilience, and network-lifetime.
James Zachary Hare, Junnan Song, Shalabh Gupta, Thomas A. Wettergren
ACM Trans. Sens. Networks2
2018 ɛ*: An Online Coverage Path Planning Algorithm
abstract
This paper presents an algorithm called ε*, for online coverage path planning of unknown environment. The algorithm is built upon the concept of an Exploratory Turing Machine (ETM), which acts as a supervisor to the autonomous vehicle to guide it with adaptive navigation commands. The ETM generates a coverage path online using Multiscale Adaptive Potential Surfaces (MAPS), which are hierarchically structured and dynamically updated based on sensor information. The ε*-algorithm is computationally efficient, guarantees complete coverage, and does not suffer from the local extrema problem. Its performance is validated by 1) high-fidelity simulations on Player/Stage and 2) actual experiments in a laboratory setting on autonomous vehicles.
Junnan Song, Shalabh Gupta
IEEE Trans. Robotics1