Made Widhi Surya Atman

Made Widhi Surya Atman

Auto-generated profile, based on publicly available information

Made Widhi Surya Atman

Faculty of Engineering and Natural Sciences, Tampere University, Tampere, Finland

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 December 2023 in IEEE Robotics and Automation Letters
Verified
Journal Article
Open access
SKShaghayegh Keyumarsi
Shaghayegh Keyumarsi
MAMade Widhi Surya Atman
Made Widhi Surya Atman
AGAzwirman Gusrialdi
Azwirman Gusrialdi
This letter presents a novel extension of the control barrier function (CBF) as the low-level safety controller for autonomous mobile robots navigating in unknown environments. The main challenges of implementing CBF in real-world situations arise from the absence of a model or the lack of an exact one for the environment. Additionally, online learning is needed for the robot to maneuver in an unknown environment which leads to dealing with the sampled data set size, memory, and computational complexity. We address these challenges by designing an online non-parametric LiDAR-based safety function using the Gaussian process (GP). It is both efficient in data size and eliminates the requirement to store previous data. Then, a CBF is synthesized using the proposed safety function to rectify the safe control input. The effectiveness of the LiDAR-based CBF synthesis for navigation in unknown environments was validated by conducting experiments on unicycle-type robots.

23 April 2018 in International Journal of Intelligent Robotics and Applications
Verified
Journal Article
Closed access
PDF file
MAMade Widhi Surya Atman
Made Widhi Surya Atman
THTakeshi Hatanaka
Takeshi Hatanaka
ZQZhihua Qu
Zhihua Qu
NCNikhil Chopra
Nikhil Chopra
JYJunya Yamauchi
Junya Yamauchi
MFMasayuki Fujita
Masayuki Fujita

25 August 2022 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Open access
MAMade Widhi Surya Atman
Made Widhi Surya Atman
AGAzwirman Gusrialdi
Azwirman Gusrialdi
The strong connectivity of a directed graph associated with the communication network topology is crucial in ensuring the convergence of many distributed estimation/control/optimization algorithms. However, the assumption on the network's strong connectivity may not always be satisfied in practice. In addition, information on the overall network topology is often not available, e.g., due to privacy concerns or geographical constraints which calls for a distributed algorithm. This paper aims to fill a crucial gap in the literature due to the absence of a fully distributed algorithm to verify and ensure in finite-time the strong connectivity of a directed network. Specifically, inspired by the maximum consensus algorithm we propose distributed algorithms that enable individual node in a networked system to verify the strong connectivity of a directed graph and further, if necessary, augment a minimum number of new links to ensure the directed graph's strong connectivity. The proposed distributed algorithms are implemented without requiring information of the overall network topology and are scalable as they only require finite storage and converge in finite number of steps. Furthermore, the algorithms also preserve the privacy in terms of the overall network's topology. Finally, the proposed distributed algorithms are demonstrated and evaluated via numerical results.

30 September 2024 in IEEE Robotics and Automation Letters
Verified
Journal Article
Open access
HPHoang Pham
Hoang Pham
NRNadun Ranasinghe
Nadun Ranasinghe
DLDong Le
Dong Le
MAMade Widhi Surya Atman
Made Widhi Surya Atman
AGAzwirman Gusrialdi
Azwirman Gusrialdi
This letter considers the problem of formation control of multi-robot systems represented by a graph featuring both rigid and elastic edges, capturing specified range tolerance to the desired inter-robot distances. The objective is to navigate the robots safely through unknown environments with obstacles, utilizing onboard sensors like LiDAR while maintaining inter-robot distance constraints. To this end, a novel cooperative control algorithm is proposed, employing quadratic programming and leveraging control barrier functions to integrate multiple control objectives seamlessly. This approach ensures a unified strategy and provides a safety certificate. Experimental validation of the proposed cooperative control algorithm is conducted using a robotic testbed.

14 November 2023 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
Mahdieh S. SadabadiMahdieh S. Sadabadi
Mahdieh S. Sadabadi
MAMade Widhi Surya Atman
Made Widhi Surya Atman
AAAnirudh Aynala
Anirudh Aynala
AGAzwirman Gusrialdi
Azwirman Gusrialdi
This paper focuses on the development of a resilient cooperative control system for leader-follower consensus problems prone to external cyber-attacks. The attackers are assumed to adversely impact data integrity and privacy by (i) injecting unknown bounded exogenous signals to actuators and (ii) eavesdropping on the physical states of followers. To mitigate the adverse effects of such attacks on the consensus, privacy, and stability of leader-follower systems, we develop a resilient cooperative control system by introducing virtual states interconnected with the physical states in such a way that the leader-follower consensus is guaranteed under unknown false data injection cyber-attacks. The dynamics of the virtual states act as a dynamical output mask, which maps the physical states of followers to some virtual states that are exchanged via a communication network. A Lyapunov-based design framework is proposed to guarantee stability and the leader-follower consensus against cyber-attacks. The decentralized design of the control variables in the proposed resilient cooperative control approach facilitates creating a plug-and-play environment, where follower nodes can easily be plugged in/out. The effectiveness of the theoretical results is evaluated using several numerical examples and implementation on a planar robot experimental testbed.

2 January 2024 in IEEE Access
Verified
Journal Article
Open access
MAMade Widhi Surya Atman
Made Widhi Surya Atman
MFMuhamad Fikri
Muhamad Fikri
KPKarlisa Priandana
Karlisa Priandana
AGAzwirman Gusrialdi
Azwirman Gusrialdi
The deployment of a group of robots equipped with sensors for monitoring, also known as a robotic sensor network, is a promising technological solution to solve time-critical societal and environmental issues. This paper considers the problem of deploying a robotic sensor network to persistently and effectively monitor multiple locations of interest in a large field represented by grids. To this end, we propose a novel two-layer control framework where the first layer (i.e., task allocation strategy) encapsulates the targeted grids into a set of tasks (small regions of interest) followed by optimally allocating the robots to each task based on their initial position (location of their base stations) and sensing capabilities. The second layer (i.e., persistent monitoring algorithm) generates each robot’s motion control input to ensure persistent monitoring over the designated region of interest. The proposed framework is demonstrated and evaluated via numerical simulations. It is shown that the proposed control framework improves real-time monitoring in terms of both the coverage performance and travel distance of the robots.