A Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network

Assigning cells to switches in a cellular mobile network is known as an NP-hard optimization problem. This means that the alternative for the solution of this type of problem is the use of heuristic methods, because they allow the discovery of a good solution in a very satisfactory computational time. This paper proposes a Beam Search method to solve the problem of assignment cell in cellular mobile networks. Some modifications in this algorithm are also presented, which allows its parallel application. Computational results obtained from several tests confirm the effectiveness of this approach and provide good solutions for large scale problems.

Autonomous mobile robots designing for the medical trash collector task

This paper describes the UNESP robotic team in the medical trash collector task, proposed on the 5 rd IEEE Latin American Robots Competition in the LEGO category. We present our understanding of the task and discuss the proposed solution, focusing on the mechanical and computational issues of the robots. The mechanics is based on rigid body capability of transforming rotational into curvilinear movement. With respect to the computational control, the system is modeled as a reactive system with sequential transition of behaviors. A state-machine is proposed to allow this transition, and the synchronization of robotic states is guaranteed by the communication system. The proposed approach has shown itself capable of dealing with the high difficulty degree of this cooperative task. ©2006 IEEE.