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

Minh Bui Vu

dblp:301/9088 · also Bui Vu Minh · DBLP profile ↗
← Back
11ranked-venue papers
0as first author
11since 2021 · last 2026
0000-0003-0222-166XORCID · verified

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

Artificial intelligence and machine learning · 6 · 6 since 2021Computer networks · 2 · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Systems, architecture and hardware · 1 · 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
Motion planning and robot control · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › path planning › path optimization
energy-efficient path planning
0.612022
Energy-Efficient Path Planning of Reconfigurable Robots in Complex Environments · IEEE Trans. Robotics 2022
Robotics › Motion planning and robot control › motion planning
sampling-based motion planning
0.612022
Energy-Efficient Path Planning of Reconfigurable Robots in Complex Environments · IEEE Trans. Robotics 2022

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

informed RRT · 0.6batch informed trees · 0.6
YearPublicationVenuePosition
2026 Model-free inverse reinforcement learning algorithms for continuous-time and discrete-time zero-sum games
Hamed Jabbari, Anh Vu Le, Minh Bui Vu, Mohan Rajesh Elara
Neurocomputing3
2026 Reliability and Security Analysis of Active RIS-Assisted IoT NOMA Networks Over Nakagami-m Fading Channels
abstract
Ensuring reliable transmission and secure communication remains a critical challenge for next-generation wireless networks, particularly in the context of sixth-generation (6G) and Internet of Things (IoT) systems. This paper investigates the reliability and physical layer security of active reconfigurable intelligent surface (ARIS)-assisted dual-hop relaying in non-orthogonal multiple access (NOMA) networks over Nakagami-mfading channels. We develop a comprehensive system model where a base station communicates with two users via a relay and an ARIS, in the presence of a potential eavesdropper. Closed-form expressions for outage probability (OP) and intercept probability (IP) are derived for both near and far users, capturing the effects of ARIS configuration, power allocation, and channel fading. Extensive Monte Carlo simulations confirm the accuracy of the analytical results and reveal that increasing the number of ARIS elements, optimizing amplification factors, and carefully allocating power can significantly enhance both reliability and secrecy performance. The findings provide valuable insights for the design of robust and secure ARIS-assisted NOMA networks in practical wireless environments.
Tan N. Nguyen, Sang Quang Nguyen 0001, Nguyen Minh Quan, Trinh Van Chien, Minh Bui Vu, Thuong Le-Tien
IEEE Internet Things J.5
2025 Towards staircase navigation and maintenance using self-reconfigurable service robot
Anh Vu Le, Tan Li Ann Pamela, Abdullah Aamir Hayat, Bharath Rajiv Nair, Phone Thiha Kyaw, Minh Bui Vu, Dinh Tung Vo, Mohan Rajesh Elara
Expert Syst. Appl.6
2025 Optimizing spatial modulation MIMO IoT systems with full-duplex/half-duplex UAVs and enhanced transmit antenna selection
Bao The Phung, Nguyen Ba Cao, Nguyen Van Vinh, Minh Bui Vu, Nguyen Huu Khanh Nhan
Perform. Evaluation4
2025 Multi-Objective Evolutionary Path Planning With Perception-Tracked Moving Targets for Robot-Aided Fire Evacuation
abstract
Efficient fire drill evacuation in high-rise buildings demands real-time perception and optimized path planning. This study presents an autonomous evacuation framework that integrates deep learning-based object detection with multi-objective trajectory planning. Using RGB-D vision, the system detects human traffic and staircases, projecting them into the robot’s workspace. The evacuation task is modeled as a Moving Target Traveling Salesman Problem (MT-TSP) and solved via a modified NSGA-II algorithm, balancing travel time, path length, safety, and accessibility. Experiments show over 90% detection accuracy and significant improvements in navigation efficiency, demonstrating the effectiveness of combining deep learning with evolutionary optimization for robotic fire drill planning.
Anh Vu Le, Cong Hien Dinh, Veerajagadheswar Prabakaran, Guangming Chen, Minh Bui Vu, Mohan Rajesh Elara
IEEE Trans Autom. Sci. Eng.5
2024 Complete coverage planning using Deep Reinforcement Learning for polyiamonds-based reconfigurable robot
Anh Vu Le, Dinh Tung Vo, Nguyen Tien Dat, Minh Bui Vu, Mohan Rajesh Elara
Eng. Appl. Artif. Intell.4
2024 On performance of RIS-aided bidirectional full-duplex systems with combining of imperfect conditions
Tan N. Nguyen, Nguyen Van Vinh, Nguyen Ba Cao, Minh Bui Vu
Wirel. Networks4
2023 Toward complete coverage planning using deep reinforcement learning by trapezoid-based transformable robot
Dinh Tung Vo, Anh Vu Le, Tri Duc Ta, Hoang Quang Minh Tran, Minh Bui Vu, Khanh Nhan Nguyen Huu
Eng. Appl. Artif. Intell.6
2022 Long-term trials for improvement of autonomous area coverage with a Tetris inspired tiling self-reconfigurable system
Anh Vu Le, Veerajagadheswar Prabakaran, Yuyao Shi, Mohan Rajesh Elara, Min Yan Naing, Tan N. Nguyen, Minh Bui Vu
Expert Syst. Appl.8
2022 A novel autonomous staircase cleaning system with robust 3D-Deep Learning-based perception technique for Area-Coverage
Veerajagadheswar Prabakaran, Prathap S. Kandasamy, Karthikeyan Elangovan, Mohan Rajesh Elara, Minh Bui Vu, Anh Vu Le
Expert Syst. Appl.5
2022 Energy-Efficient Path Planning of Reconfigurable Robots in Complex Environments
abstract
Planning the energy-efficient and collision-free paths for reconfigurable robots in complex environments is more challenging than conventional fixed-shaped robots due to their flexible degrees of freedom while navigating through tight spaces. This article presents a novel algorithm, energy-efficient batch informed trees* (BIT*) for reconfigurable robots, which incorporates BIT*, an informed, anytime sampling-based planner, with the energy-based objectives that consider the energy cost for robot’s each reconfigurable action. Moreover, it proposes to improve the direct sampling technique of informed RRT* by defining an$L^2$greedy informed setthat shrinks as a function of the state with the maximum admissible estimated cost instead of shrinking as a function of the current solution, thereby improving the convergence rate of the algorithm. Experiments were conducted on a tetromino hinged-based reconfigurable robot as a case study to validate our proposed path planning technique. The outcome of our trials shows that the proposed approach produces energy-efficient solution paths, and outperforms existing techniques on simulated and real-world experiments.
Phone Thiha Kyaw, Anh Vu Le, Veerajagadheswar Prabakaran, Mohan Rajesh Elara, Theint Theint Thu, Khanh Nhan Nguyen Huu, Minh Bui Vu
IEEE Trans. Robotics8