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

Dongge Han

dblp:241/7909 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
3since 2021 · last 2025
0000-0003-2322-1941ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 3 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 1 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
1 paper
Reinforcement learning · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning
hierarchical reinforcement learning
0.612022
Option Transfer and SMDP Abstraction with Successor Features · IJCAI 2022
Machine learning › Reinforcement learning › hierarchical reinforcement learning
state and temporal abstraction
0.612022
Option Transfer and SMDP Abstraction with Successor Features · IJCAI 2022
Machine learning › Reinforcement learning › function approximation › representation learning for reinforcement learning
successor features
0.612022
Option Transfer and SMDP Abstraction with Successor Features · IJCAI 2022
Algorithmic game theory and mechanism design › non-cooperative game
boolean games
0.512021
Behavioural strategies in weighted Boolean games · Inf. Comput. 2021
Algorithmic game theory and mechanism design › cooperative game theory
solution concepts
0.512021
Behavioural strategies in weighted Boolean games · Inf. Comput. 2021

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

successor features · 0.6
YearPublicationVenuePosition
2025 LLM-Personalize: Aligning LLM Planners with Human Preferences via Reinforced Self-Training for Housekeeping Robots
abstract
Large language models (LLMs) have shown significant potential for robotics applications, particularly task planning, by harnessing their language comprehension and text generation capabilities. However, in applications such as household robotics, a critical gap remains in the personalization of these models to household preferences. For example, an LLM planner may find it challenging to perform tasks that require personalization, such as deciding where to place mugs in a kitchen based on specific household preferences. We introduce LLM-Personalize, a novel framework designed to personalize LLM planners for household robotics. LLM-Personalize uses an LLM planner to perform iterative planning in multi-room, partially-observable household environments, utilizing a scene graph built dynamically from local observations. To personalize the LLM planner towards user preferences, our optimization pipeline integrates imitation learning and reinforced Self-Training. We evaluate LLM-Personalize on Housekeep, a challenging simulated real-world 3D benchmark for household rearrangements, demonstrating a more than 30 percent increase in success rate over existing LLM planners, showcasing significantly improved alignment with human preferences.
Dongge Han, Trevor McInroe, Adam Jelley, Stefano V. Albrecht, Peter Bell 0001, Amos J. Storkey
COLING1
2022 Option Transfer and SMDP Abstraction with Successor Features
abstract
Abstraction plays an important role in the generalisation of knowledge and skills and is key to sample efficient learning. In this work, we study joint temporal and state abstraction in reinforcement learning, where temporally-extended actions in the form of options induce temporal abstractions, while aggregation of similar states with respect to abstract options induces state abstractions. Many existing abstraction schemes ignore the interplay of state and temporal abstraction. Consequently, the considered option policies often cannot be directly transferred to new environments due to changes in the state space and transition dynamics. To address this issue, we propose a novel abstraction scheme building on successor features. This includes an algorithm for transferring abstract options across different environments and a state abstraction mechanism that allows us to perform efficient planning with the transferred options.
Dongge Han, Sebastian Tschiatschek
IJCAI1
2021 Behavioural strategies in weighted Boolean games
Dongge Han, Paul Harrenstein, Steven Nugent, Jonathan Philpott, Michael J. Wooldridge
Inf. Comput.1
2019 Multi-agent Hierarchical Reinforcement Learning with Dynamic Termination
Dongge Han, Wendelin Böhmer, Michael J. Wooldridge, Alex Rogers
PRICAI (2)1