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.

Hans He

dblp:322/6396 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2023
—ORCID · unresolved

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Systems, architecture and hardware · 2 · 1 first-author · 2 since 2021

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
2 papers
Robot navigation and mapping · 47% Multi-agent systems · 20% Reinforcement learning · 20%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping
environment mapping
0.922023
Experiments in Underwater Feature Tracking with Performance Guarantees Using a Small AUV · ICRA 2023
Decentralized Multi-agent Exploration with Limited Inter-agent Communications · ICRA 2023
Robotics › Robot navigation and mapping › environment mapping
bathymetric mapping
0.712023
Experiments in Underwater Feature Tracking with Performance Guarantees Using a Small AUV · ICRA 2023
Machine learning › Reinforcement learning › multi-agent reinforcement learning › multi-agent communication
information sharing
0.712023
Decentralized Multi-agent Exploration with Limited Inter-agent Communications · ICRA 2023
Robotics › Motion planning and robot control
motion planning
0.212023
Experiments in Underwater Feature Tracking with Performance Guarantees Using a Small AUV · ICRA 2023
Robotics › Motion planning and robot control › motion planning › online motion planning
receding horizon planning
0.212023
Experiments in Underwater Feature Tracking with Performance Guarantees Using a Small AUV · ICRA 2023

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

gaussian process · 1.3submodular set optimization · 0.7receding horizon planning · 0.7performance guarantees · 0.7log-determinant · 0.7
YearPublicationVenuePosition
2023 Experiments in Underwater Feature Tracking with Performance Guarantees Using a Small AUV
abstract
We present the results of experiments performed using a small autonomous underwater vehicle to determine the location of an isobath within a bounded area. The primary contribution of this work is to implement and integrate several recent developments real-time planning for environmental map-ping, and to demonstrate their utility in a challenging practical example. We model the bathymetry within the operational area using a Gaussian process and propose a reward function that represents the task of mapping a desired isobath. As is common in applications where plans must be continually updated based on real-time sensor measurements, we adopt a receding horizon framework where the vehicle continually computes near-optimal paths. The sequence of paths does not, in general, inherit the optimality properties of each individual path. Our real-time planning implementation incorporates recent results that lead to performance guarantees for receding-horizon planning.
Benjamin Biggs, Hans He, James McMahon, Daniel J. Stilwell
ICRA2
2023 Decentralized Multi-agent Exploration with Limited Inter-agent Communications
abstract
We consider the problem of decentralized multiagent environmental learning through maximizing the joint information gain among a team of agents. Inspired by subsea applications where bandwidth is severely limited, we explicitly consider the challenge of restricted communication between agents. The environment is modeled as a Gaussian process (GP), and the global information gain maximization problem in a GP is a set-valued optimization problem involving all agents' locally acquired data. We develop a decentralized method to solve it based on decomposition of information gain and exchange of limited subsets of data between agents. A key technical novelty of our approach is that we formulate the incentives for information exchange among agents as a submodular set optimization problem in terms of the log-determinant of their local covariance matrices. Numerical experiments on real-world data demonstrate the ability of our algorithm to explore trade-off between objectives. In particular, we demonstrate favorable performance on mapping problems where both decentralized information gathering and limited information exchange are essential.
Hans He, Alec Koppel, Amrit Singh Bedi, Daniel J. Stilwell, Mazen Farhood, Benjamin Biggs
ICRA1