Luneque Silva Junior
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
Research Subjects
Luneque Silva Junior has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Nadia Nedjah
State University of Rio de Janeiro
14 shared publications - Luiza de Macedo Mourelle
State University of Rio de Janeiro
8 shared publications Fábio Gonçalves Pessanha
State University of Rio de Janeiro
2 shared publicationsFelipe França
1 shared publicationNadia Nedjah
1 shared publication
Latest Publications
- 1 November 2019
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 50
Review of methodologies and tasks in swarm robotics towards standardization
- 1 November 2019
- Published by Elsevier in Swarm and Evolutionary Computation
- Vol. 50
Review of methodologies and tasks in swarm robotics towards standardization
- 1 August 2017
- Published by Elsevier in Applied Soft Computing
- Vol. 57, 698-707
Wave algorithm applied to collective navigation of robotic swarms
- 1 August 2017
- Published by Elsevier in Applied Soft Computing
- Vol. 57, 698-707
Wave algorithm applied to collective navigation of robotic swarms
- 7 February 2017
- Published by IGI Global Scientific Publishing
- p. 671-693
Distributed Algorithms for Recruitment and Coordinated Motion in Swarm Robotic Systems
In the last decades, studies on swarm robotics have grown significantly, with different implementation details becoming of interest in research works. Although the first idea in swarm robotics should be the application or the task that robots should perform, other aspects can be studied. In a robotic swarm, it may be necessary to select the robots that will perform a given task, which is a division of labor among the members. A similar problem is that of robot recruitment, required when a specific robot needs assistance to execute some tasks and starts recruiting other robots of the swarm. In this chapter, a distributed algorithm, termed the wave algorithm, is exploited to perform the recruitment based on robot message passing to neighboring robots. The intended task to be done is the coordinated motion of the recruited robots that must follow the robot that starts the recruitment.
- 7 February 2017
- Published by IGI Global Scientific Publishing
- p. 671-693
Distributed Algorithms for Recruitment and Coordinated Motion in Swarm Robotic Systems
In the last decades, studies on swarm robotics have grown significantly, with different implementation details becoming of interest in research works. Although the first idea in swarm robotics should be the application or the task that robots should perform, other aspects can be studied. In a robotic swarm, it may be necessary to select the robots that will perform a given task, which is a division of labor among the members. A similar problem is that of robot recruitment, required when a specific robot needs assistance to execute some tasks and starts recruiting other robots of the swarm. In this chapter, a distributed algorithm, termed the wave algorithm, is exploited to perform the recruitment based on robot message passing to neighboring robots. The intended task to be done is the coordinated motion of the recruited robots that must follow the robot that starts the recruitment.
- Open Access
- 1 January 2016
- Published by Elsevier in Procedia Computer Science
- Vol. 80, 814-823
Efficient Strategy for Collective Navigation Control in Swarm Robotics
- 1 January 2016
- Published by Elsevier in Procedia Computer Science
- Vol. 80, 814-823
Open AccessEfficient Strategy for Collective Navigation Control in Swarm Robotics
- 1 January 2016
- Published by Inderscience Publishers in International Journal of Bio-Inspired Computation
- Vol. 8 (2) , 99-108
Distributed strategy for robots recruitment in swarm-based systems
In a scenario wherein several tasks must be done cooperatively by a robotic swarm, it is sometimes mandatory to prescribe the robots that should execute each one of those tasks. A problem related to the division of labour among the swarm members is the robot recruitment. When a specific robot needs assistance, it must create a group, selecting other robots to help in the execution of the given task. The main contribution of this work is the development of a distributed recruitment strategy based mainly on the propagation of messages among neighbouring robots. The algorithm is evaluated through simulations, wherein some recruitment features are analysed by subjecting the swarm to different conditions, such as the total number of robots in the swarm and the number of robots that start the recruitment. This strategy is promising, since robots have no global knowledge about the swarm, relying only in the neighbourhood information.
- 1 January 2016
- Published by Inderscience Publishers in International Journal of Bio-Inspired Computation
- Vol. 8 (2) , 99-108
Distributed strategy for robots recruitment in swarm-based systems
In a scenario wherein several tasks must be done cooperatively by a robotic swarm, it is sometimes mandatory to prescribe the robots that should execute each one of those tasks. A problem related to the division of labour among the swarm members is the robot recruitment. When a specific robot needs assistance, it must create a group, selecting other robots to help in the execution of the given task. The main contribution of this work is the development of a distributed recruitment strategy based mainly on the propagation of messages among neighbouring robots. The algorithm is evaluated through simulations, wherein some recruitment features are analysed by subjecting the swarm to different conditions, such as the total number of robots in the swarm and the number of robots that start the recruitment. This strategy is promising, since robots have no global knowledge about the swarm, relying only in the neighbourhood information.
- 10 December 2014
- Published by Taylor & Francis in International Journal of Electronics
- Vol. 102 (10) , 1-18
Efficient routing in network-on-chip for 3D topologies
With the increasing of the integration capability intra-chip, nowadays numerous integrated systems explore a set of processing elements, such as in multicore processors. An efficient interconnection of those elements can be obtained via the use of Network on chip (NoC). This approach is similar to the traditional computer networks where, not restricted to multiprocessors, it is possible to interconnect several dedicated devices. Like other networks, NoCs can be arranged in different topologies, such as ring, mesh and torus. It has shared links that can be used in the transmission of packets of different nodes. Thus, the network congestion is an issue and must be treated to reduce delays. Algorithms based on ant colony optimisation have proven to be effective in static routing in systems designed to perform a fixed set of tasks, or where the communication pattern is known. This article introduces 3D ant colony routing (3D-ACR) and applies it as routing policy of NoCs having three different 3D topologies: mesh, torus and hypercube. Experimental results show that 3D ant colony routing performs consistently better compared with the previously proposed routing strategies.
- 10 December 2014
- Published by Taylor & Francis in International Journal of Electronics
- Vol. 102 (10) , 1-18
Efficient routing in network-on-chip for 3D topologies
With the increasing of the integration capability intra-chip, nowadays numerous integrated systems explore a set of processing elements, such as in multicore processors. An efficient interconnection of those elements can be obtained via the use of Network on chip (NoC). This approach is similar to the traditional computer networks where, not restricted to multiprocessors, it is possible to interconnect several dedicated devices. Like other networks, NoCs can be arranged in different topologies, such as ring, mesh and torus. It has shared links that can be used in the transmission of packets of different nodes. Thus, the network congestion is an issue and must be treated to reduce delays. Algorithms based on ant colony optimisation have proven to be effective in static routing in systems designed to perform a fixed set of tasks, or where the communication pattern is known. This article introduces 3D ant colony routing (3D-ACR) and applies it as routing policy of NoCs having three different 3D topologies: mesh, torus and hypercube. Experimental results show that 3D ant colony routing performs consistently better compared with the previously proposed routing strategies.
- 1 November 2013
- Published by Elsevier in Expert Systems with Applications
- Vol. 40 (16) , 6661-6673
Congestion-aware ant colony based routing algorithms for efficient application execution on Network-on-Chip platform
- 1 November 2013
- Published by Elsevier in Expert Systems with Applications
- Vol. 40 (16) , 6661-6673
Congestion-aware ant colony based routing algorithms for efficient application execution on Network-on-Chip platform
- 1 May 2013
- Published by Elsevier in Applied Soft Computing
- Vol. 13 (5) , 2224-2231
Routing for applications in NoC using ACO-based algorithms
- 1 May 2013
- Published by Elsevier in Applied Soft Computing
- Vol. 13 (5) , 2224-2231
Routing for applications in NoC using ACO-based algorithms