Tamás Lukovszki
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Tamás Lukovszki has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
Peter Ekler
5 shared publicationsBertalan Forstner
Department of Automation and Applied Informatics, Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics, H-1117 Budapest, Magyar Tudósok krt. 2., Hungary
3 shared publicationsAttila Hideg
Department of Automation and Applied Informatics, Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics, H-1117 Budapest, Magyar Tudósok krt. 2., Hungary
2 shared publications- Attila Hideg
Budapest University of Technology and Economics
2 shared publications - Bertalan Forstner
Department of Automation and Applied Informatics, Faculty of Electrical Engineering and Informatics, Budapest University of Technology and Economics, Műegyetem rkp. 3., H-1111 Budapest, Hungary
2 shared publications - Jukka K. Nurminen
University of Helsinki, Helsinki, Finland
2 shared publications
Latest Publications
- Open Access
- 23 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 124-131
Multi-Robot Simulation Framework for Construction Problems
- 23 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 124-131
Open AccessMulti-Robot Simulation Framework for Construction Problems
- 27 September 2022
- Published by Springer Nature
- p. 239-258
RobotCore—A General Multi-robot Simulation Framework
- 27 September 2022
- Published by Springer Nature
- p. 239-258
RobotCore—A General Multi-robot Simulation Framework
- Open Access
- 17 January 2022
- Published by Periodica Polytechnica Budapest University of Technology and Economics in Periodica Polytechnica Electrical Engineering and Computer Science
- Vol. 66 (1) , 12-19
Improved Runtime for the Synchronous Multi-door Filling
In this paper, a particular type of dispersion is further investigated, which is called Filling. In this problem, robots are injected one by one into an a priori not known area and have to travel across until the whole area is covered. The coverage is achieved by a robotic team whose hardware capabilities are restricted in order to maintain low production costs. This includes limited viewing and communication ranges. In this work, we present an algorithm solving the synchronous Filling problem in O((k + ∆)·n) time steps by n robots with a viewing range of 1 hop, where k is the number of doors, n is the number of vertices of the graph, and ∆ is the maximum degree of the graph. This improves the best previously known running time bound of O(k · ∆ · n). Furthermore, we remove the constraint from the previous algorithm that the door vertices need to have a degree of 1.
- 17 January 2022
- Published by Periodica Polytechnica Budapest University of Technology and Economics in Periodica Polytechnica Electrical Engineering and Computer Science
- Vol. 66 (1) , 12-19
Open AccessImproved Runtime for the Synchronous Multi-door Filling
In this paper, a particular type of dispersion is further investigated, which is called Filling. In this problem, robots are injected one by one into an a priori not known area and have to travel across until the whole area is covered. The coverage is achieved by a robotic team whose hardware capabilities are restricted in order to maintain low production costs. This includes limited viewing and communication ranges. In this work, we present an algorithm solving the synchronous Filling problem in O((k + ∆)·n) time steps by n robots with a viewing range of 1 hop, where k is the number of doors, n is the number of vertices of the graph, and ∆ is the maximum degree of the graph. This improves the best previously known running time bound of O(k · ∆ · n). Furthermore, we remove the constraint from the previous algorithm that the door vertices need to have a degree of 1.
- Open Access
Asynchronous Filling by Myopic Luminous Robots
We consider the problem of filling an unknown area represented by an arbitrary connected graph of $n$ vertices by mobile luminous robots. In this problem, the robots enter the graph one-by-one through a specific vertex, called the Door, and they eventually have to cover all vertices of the graph while avoiding collisions. The robots are anonymous and make decisions driven by the same local rule of behavior. They have limited persistent memory and limited visibility range. We investigate the Filling problem in the asynchronous model. We assume that the robots know an upper bound $\Delta$ on the maximum degree of the graph before entering. We present an algorithm solving the asynchronous Filling problem with robots having $1$ hop visibility range, $O(\log\Delta)$ bits of persistent storage, and $\Delta+4$ colors, including the color when the light is off. We analyze the algorithm in terms of asynchronous rounds, where a round means the smallest time interval in which each robot, which has not yet finished the algorithm, has been activated at least once. We show that this algorithm needs $O(n^2)$ asynchronous rounds. Our analysis provides the first asymptotic upper bound on the running time in terms of asynchronous rounds. Then we show how the number of colors can be reduced to $O(1)$ at the cost of the running time. The algorithm with $1$ hop visibility range, $O(\log \Delta)$ bits of persistent memory, and $O(1)$ colors needs $O(n^2\log \Delta)$ rounds. We show how the running time can be improved by robots with a visibility range of $2$ hops, $O(\log \Delta)$ bits of persistent memory, and $\Delta + 4$ colors (including the color when the light is off). We show that the algorithm needs $O(n)$ asynchronous rounds. Finally, we show how to extend our solution to the $k$-Door case, $k\geq 2$, by using $\Delta + k + 4$ colors, including the color when the light is off.Open AccessAsynchronous Filling by Myopic Luminous Robots
We consider the problem of filling an unknown area represented by an arbitrary connected graph of $n$ vertices by mobile luminous robots. In this problem, the robots enter the graph one-by-one through a specific vertex, called the Door, and they eventually have to cover all vertices of the graph while avoiding collisions. The robots are anonymous and make decisions driven by the same local rule of behavior. They have limited persistent memory and limited visibility range. We investigate the Filling problem in the asynchronous model. We assume that the robots know an upper bound $\Delta$ on the maximum degree of the graph before entering. We present an algorithm solving the asynchronous Filling problem with robots having $1$ hop visibility range, $O(\log\Delta)$ bits of persistent storage, and $\Delta+4$ colors, including the color when the light is off. We analyze the algorithm in terms of asynchronous rounds, where a round means the smallest time interval in which each robot, which has not yet finished the algorithm, has been activated at least once. We show that this algorithm needs $O(n^2)$ asynchronous rounds. Our analysis provides the first asymptotic upper bound on the running time in terms of asynchronous rounds. Then we show how the number of colors can be reduced to $O(1)$ at the cost of the running time. The algorithm with $1$ hop visibility range, $O(\log \Delta)$ bits of persistent memory, and $O(1)$ colors needs $O(n^2\log \Delta)$ rounds. We show how the running time can be improved by robots with a visibility range of $2$ hops, $O(\log \Delta)$ bits of persistent memory, and $\Delta + 4$ colors (including the color when the light is off). We show that the algorithm needs $O(n)$ asynchronous rounds. Finally, we show how to extend our solution to the $k$-Door case, $k\geq 2$, by using $\Delta + k + 4$ colors, including the color when the light is off. - 20 November 2015
- Published by Springer Nature
- p. 104-118
Online Admission Control and Embedding of Service Chains
- 20 November 2015
- Published by Springer Nature
- p. 104-118
Online Admission Control and Embedding of Service Chains
- 20 May 2014
- Published by Fuji Technology Press Ltd. in Journal of Advanced Computational Intelligence and Intelligent Informatics
- Vol. 18 (3) , 315-319
Surrounding Robots – A Discrete Localized Solution for the Intruder Problem –
Welcome to the official website of Journal of Advanced Computational Intelligence and Intelligent Informatics.
- 20 May 2014
- Published by Fuji Technology Press Ltd. in Journal of Advanced Computational Intelligence and Intelligent Informatics
- Vol. 18 (3) , 315-319
Surrounding Robots – A Discrete Localized Solution for the Intruder Problem –
Welcome to the official website of Journal of Advanced Computational Intelligence and Intelligent Informatics.
- 1 January 2014
- Published by Springer Nature
- p. 248-262
Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots
- 1 January 2014
- Published by Springer Nature
- p. 248-262
Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots
- 13 December 2013
- Published by Springer Nature
- p. 83-94
Fast Localized Sensor Self-Deployment for Focused Coverage
- 13 December 2013
- Published by Springer Nature
- p. 83-94
Fast Localized Sensor Self-Deployment for Focused Coverage
- 1 September 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21613559,p. 1-9
On a balanced neighbor selection strategy for tracker-based peer-to-peer networks
In this paper we introduce a novel neighbor selection strategy for tracker-based peer-to-peer systems like BitTorrent that can uniformly distribute the load among peers in the network. Our method is based on a balanced multiple choice algorithm which takes into account not only the actual load of a peer, but the possibility as well that it will be selected in the future. We first analyze the properties of the constructed overlay topology theoretically, proving that, the maximum degree in the constructed graph is O(1) while the diameter remains O(ln n), with high probability, where n is the number of nodes. Considering a randomized upload policy, we show that the full distribution of b blocks on the network generated by our neighbor selection strategy takes O(b + ln n) phases only, with high probability, which is optimal up to a constant factor. This result improves the previous upper bound of O(b+(ln n) 2 ) by Arthur and Panigrahy (SODA'06). In order to adapt our algorithm in real BitTorrent networks only a slight modification of the tracker is necessary without any change in the clients. Besides theoretical analysis, thorough simulations have been done to validate our algorithm and show its applicability in real BitTorrent networks. To this end, we have extended the BitTorrent implementation of the PeerSim simulation framework with a new tracker using our balanced neighbor selection strategy and demonstrated that it can speed up the file-sharing process in heavy loaded situations.
- 1 September 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21613559,p. 1-9
On a balanced neighbor selection strategy for tracker-based peer-to-peer networks
In this paper we introduce a novel neighbor selection strategy for tracker-based peer-to-peer systems like BitTorrent that can uniformly distribute the load among peers in the network. Our method is based on a balanced multiple choice algorithm which takes into account not only the actual load of a peer, but the possibility as well that it will be selected in the future. We first analyze the properties of the constructed overlay topology theoretically, proving that, the maximum degree in the constructed graph is O(1) while the diameter remains O(ln n), with high probability, where n is the number of nodes. Considering a randomized upload policy, we show that the full distribution of b blocks on the network generated by our neighbor selection strategy takes O(b + ln n) phases only, with high probability, which is optimal up to a constant factor. This result improves the previous upper bound of O(b+(ln n) 2 ) by Arthur and Panigrahy (SODA'06). In order to adapt our algorithm in real BitTorrent networks only a slight modification of the tracker is necessary without any change in the clients. Besides theoretical analysis, thorough simulations have been done to validate our algorithm and show its applicability in real BitTorrent networks. To this end, we have extended the BitTorrent implementation of the PeerSim simulation framework with a new tracker using our balanced neighbor selection strategy and demonstrated that it can speed up the file-sharing process in heavy loaded situations.