Initial detailed routing algorithms

In this work, we present a study of the problem of routing in the context of the VLSI physical synthesis flow. We study the fundamental routing algorithms such as maze routing, A*, and Steiner tree-based algorithms, as well as some global routing algorithms, namely FastRoute 4.0 and BoxRouter 2.0. We dissect some of the major state of the art initial detailed routing tools, such as RegularRoute, TritonRoute, SmartDR and Dr.CU 2.0. We also propose an initial detailed routing flow, and present an implementation of the proposed routing flow, with a track assignment technique that models the problem as an instance of the maximum independent weighted set (MWIS) and utilizes integer linear programming (ILP) as a solver. The implementation of the proposed initial detailed routing flow also includes an implementation of multiple-source and multiple-target A* for terminal andnet connection with adjustable rules and weights. Finally, we also present a study of the results obtained by the implementation of the proposed initial detailed routing flow and a comparison with the ISPD 2019 contest winners, considering the ISPD 2019 and benchmark suite and evaluation tools.Neste trabalho, apresentamos um estudo do problema de roteamento no contexto do fluxo de síntese física de circuitos integrados VLSI. Nós estudamos algoritmos de roteamento fundamentais como roteamento de labirinto, A* e baseados em árvores de Steiner, além de alguns algoritmos de roteamento global como FastRoute 4.0 e BoxRouter 2.0. Nós dissecamos alguns dos principais trabalhos de roteamento detalhado inicial do estado da arte, como RegularRoute, TritonRoute, SmartDR e Dr.CU 2.0. Também propomos um fluxo de roteamento detalhado inicial, e apresentamos uma implementação do fluxo de roteametno proposto, com uma técnica de assinalamento de trilhas que modela o problema como uma instância do problema do conjunto independente de peso máximo e usa programação linear inteira como um resolvedor. A implementação do fluxo de rotemaento detalhado inicial proposto também inclui uma implementação de um A* com múltiplas fontes e múltiplos destinos para conexão de terminais e redes, com regras e pesos ajustáveis. Por fim, nós apresentamos um estudo dos resultados obtidos pela implementação do fluxo de roteamento detalhado inicial proposto e comparamos com os vencedores do ISPD 2019 contest considerando a suíte de teste e ferramentas de avaliação do ISPD 2019

Target Tracking in Confined Environments with Uncertain Sensor Positions

To ensure safety in confined environments such as mines or subway tunnels, a (wireless) sensor network can be deployed to monitor various environmental conditions. One of its most important applications is to track personnel, mobile equipment and vehicles. However, the state-of-the-art algorithms assume that the positions of the sensors are perfectly known, which is not necessarily true due to imprecise placement and/or dropping of sensors. Therefore, we propose an automatic approach for simultaneous refinement of sensors' positions and target tracking. We divide the considered area in a finite number of cells, define dynamic and measurement models, and apply a discrete variant of belief propagation which can efficiently solve this high-dimensional problem, and handle all non-Gaussian uncertainties expected in this kind of environments. Finally, we use ray-tracing simulation to generate an artificial mine-like environment and generate synthetic measurement data. According to our extensive simulation study, the proposed approach performs significantly better than standard Bayesian target tracking and localization algorithms, and provides robustness against outliers.Comment: IEEE Transactions on Vehicular Technology, 201

Analysis, evaluation and improvement of RT-WMP for real-time and QoS wireless communication: Applications in confined environments

En los ultimos años, la innovación tecnológica, la característica de flexibilidad y el rápido despligue de las redes inalámbricas, han favorecido la difusión de la redes móviles ad-hoc (MANETs), capaces de ofrecer servicios para tareas específicas entre nodos móviles. Los aspectos relacionados al dinamismo de la topología móvil y el acceso a un medio compartido por naturaleza hacen que sea preciso enfrentarse a clases de problemas distintos de los relacionados con la redes cableadas, atrayendo de este modo el interés de la comunidad científica. Las redes ad-hoc suelen soportar tráfico con garantía de servicio mínimo y la mayor parte de las propuestas presentes en literatura tratan de dar garantías de ancho de banda o minimizar el retardo de los mensajes. Sin embargo hay situaciones en las que estas garantías no son suficientes. Este es el caso de los sistemas que requieren garantías mas fuertes en la entrega de los mensajes, como es el caso de los sistemas de tiempo real donde la pérdida o el retraso de un sólo mensaje puede provocar problemas graves. Otras aplicaciones como la videoconferencia, cada vez más extendidas, implican un tráfico de datos con requisitos diferentes, como la calidad de servicio (QoS). Los requisitos de tiempo real y de QoS añaden nuevos retos al ya exigente servicio de comunicación inalámbrica entre estaciones móviles de una MANET. Además, hay aplicaciones en las que hay que tener en cuenta algo más que el simple encaminamiento de los mensajes. Este es el caso de aplicaciones en entornos subterráneos, donde el conocimiento de la evolución de propagación de la señal entre los diferentes nodos puede ser útil para mejorar la calidad de servicio y mantener la conectividad en cada momento. A pesar de ésto, dentro del amplio abanicos de propuestas presente en la literatura, existen un conjunto de limitaciones que van de el mero uso de protocolos simulados a propuestas que no tienen en cuenta entornos no convencionales o que resultan aisladas desde el punto de vista de la integración en sistemas complejos. En esta tesis doctoral, se propone un estudio completo sobre un plataforma inalámbrica de tiempo real, utilizando el protocolo RT-WMP capaz de gestionar trafíco multimedia al mismo tiempo y adaptado al entorno de trabajo. Se propone una extensión para el soporte a los datos con calidad de servicio sin limitar las caractaristícas temporales del protocolo básico. Y con el fin de tener en cuenta el efecto de la propagación de la señal, se caracteriza el entorno por medio de un conjunto de restricciones de conectividad. La solución ha sido desarrollada y su validez ha sido demostrada extensamente en aplicaciones reales en entornos subterráneos, en redes malladas y aplicaciones robóticas

Using GRASP and GA to design resilient and cost-effective IP/MPLS networks

The main objective of this thesis is to find good quality solutions for representative instances of the problem of designing a resilient and low cost IP/MPLS network, to be deployed over an existing optical transport network. This research is motivated by two complementary real-world application cases, which comprise the most important commercial and academic networks of Uruguay. To achieve this goal, we performed an exhaustive analysis of existing models and technologies. From all of them we took elements that were contrasted with the particular requirements of our counterparts. We highlight among these requirements, the need of getting solutions transparently implementable over a heterogeneous network environment, which limit us to use widely standardized features of related technologies. We decided to create new models more suitable to fit these needs. These models are intrinsically hard to solve (NP-Hard). Thus we developed metaheuristic based algorithms to find solutions to these real-world instances. Evolutionary Algorithms and Greedy Randomized Adaptive Search Procedures obtained the best results. As it usually happens, real-world planning problems are surrounded by uncertainty. Therefore, we have worked closely with our counterparts to reduce the fuzziness upon data to a set of representative cases. They were combined with different strategies of design to get to scenarios, which were translated into instances of these problems. Finally, the algorithms were fed with this information, and from their outcome we derived our results and conclusions

Ground robotics in tunnels: Keys and lessons learned after 10 years of research and experiments

The work reported in this article describes the research advances and the lessons learned by the Robotics, Perception and Real-Time group over a decade of research in the field of ground robotics in confined environments. This study has primarily focused on localization, navigation, and communications in tunnel-like environments. As will be discussed, this type of environment presents several special characteristics that often make well-established techniques fail. The aim is to share, in an open way, the experience, errors, and successes of this group with the robotics community so that those that work in such environments can avoid (some of) the errors made. At the very least, these findings can be readily taken into account when designing a solution, without needing to sift through the technical details found in the papers cited within this text

Two-step Meta-heuristic Approach for a Vehicle Assignment Problem – Case from İstanbul/Turkey

In this paper, a two-step meta-heuristic approach is proposed for vehicle assignment problem with geometric shape-based clustering and genetic algorithm. First, the geometric shape-based clustering method is used and then the solution of this method is given to the genetic algorithm as initial solution. The solution process is continued by genetic algorithm. There are 282 bus lines in İstanbul European side. Those buses should be assigned to six bus garages. The proposed method is used to determine the minimum distance between the bus lines and garages by assigning buses to garages. According to the computational results, the proposed algorithm has better clustering performance in terms of the distance from each bus-line start point to each bus garage in the cluster. The crossover rate changing method is also applied as a trial in order to improve the algorithm performance. Finally, the outputs that are generated by different crossover rates are compared with the results of the k-Nearest Neighbour algorithm to prove the effectiveness of the study.</p

Propagation, Localization and Navigation in Tunnel-like Environments

La robótica de servicio, entendida como aquella destinada al uso de uno o varios robots con fines de, por ejemplo, vigilancia, rescate e inspecciones, ha ido tomando cada vez más relevancia en los últimos años. Debido a los grandes avances en las distintas áreas de la robótica, los robots han sido capaces de ejecutar satisfactoriamente tareas que resultan peligrosas o incluso imposibles para los humanos, en diversos entornos. Entre ellos, los entornos confinados como túneles, minas y tuberías, han atraído la atención en aplicaciones relacionadas con transporte ferroviario, redes vehiculares, búsqueda y rescate, y vigilancia, tanto en el ámbito civil como militar. En muchas tareas, la utilización de varios robots resulta más provechoso que utilizar sólo uno. Para cooperar, los robots deben intercambiar información sobre el entorno y su propio estado, por lo que la comunicación entre ellos resulta crucial. Debido a la imposibilidad de utilizar redes cableadas entre robots móviles, se despliegan redes inalámbricas. Para determinar la calidad de señal entre dos robots, inicialmente se utilizaban modelos de propagación basados únicamente en la distancia entre ellos. Sin embargo, estas predicciones sólo resultan útiles en exteriores y sin la presencia de obstáculos, que sólo componen una pequeña parte de los escenarios de la robótica de servicio. Mas aún, la naturaleza altamente multi-trayecto de la propagación electromagnética en túneles hace que éstos actúen como guías de onda para cierto rango de frecuencias, extendiendo considerablemente el alcance de comunicación en comparación con entornos exteriores. Sin embargo, la señal se ve afectada con profundos desvanecimientos (llamados fadings en inglés). Esto los convierte en un reto para la robótica que considera la comunicación entre robots como fundamental. Además, la naturaleza hostil de estos entornos, así como también la falta de características visuales y estructurales, dificultan la localización en estos escenarios, cuestión que resulta fundamental para ejecutar con éxito una tarea con un robot. Los métodos de localización utilizados en interiores, como aquellos basados en SLAM visual, resultan imprecisos por la falta de características distintivas para cámaras o lásers, mientras que los sensores utilizados en exteriores, como el GPS, no funcionan dentro de túneles o tuberías. En esta tesis abordamos problemas fundamentales para la robótica con el fin de proporcionar herramientas necesarias para la exploración con robots en entornos tipo túnel, manteniendo la conectividad de la red de comunicaciones formada por varios robots y una estación base. Para ello, primeramente caracterizamos, en términos de propagación, los dos escenarios tipo túnel más comunes: un túnel de hormigón y una tubería metálica. Hacemos énfasis en el fenómeno de los fadings, ya que son el problema más importante a considerar para mantener la comunicación. Posteriormente presentamos una estrategia de navegación para desplegar un equipo de robots en un túnel, lidiando con los fadings para mantener la conectividad de la red formada por los robots. Esta estrategia ha sido validada a través de numerosos experimentos realizados en un túnel real, el túnel de Somport. Luego, abordamos el problema de la localización, proponiendo e implementando una técnica que permite estimar la posición de un robot dentro de una tubería, basada en la periodicidad de los fadings. El método es validado a través de experimentos reales en tuberías de pequeña y grandes dimensiones. Finalmente, proponemos esquemas de diversidad espacial, de forma que se facilita la navegación mientras se mejora la localización.Deploying a team of robots for search and rescue, inspection, or surveillance, has increasingly gained attention in the last years. As a result of the advances in several areas of robotics, robots have been able to successfully execute tasks that are hazardous or even impossible for humans in a variety of scenarios, such as outdoors, indoors, or even underground. Among these scenarios, tunnel-like environments (such as tunnels, mines, or pipes) have attracted attention for train applications, vehicular networks, search and rescue, and even service and surveillance missions in both military and civilian contexts. In most of the tasks, utilizing a multi-robot team yields better results than a singlerobot system, as it makes the system more robust while reducing the time required to complete tasks. In order to cooperate, robots must exchange information about their current state and the surrounding environment, making communication between them a crucial task. However, due to the mobile nature of robots used for exploration, a wired architecture is not possible nor convenient. Instead, a wireless network is often deployed. Wireless propagation in tunnel-like environments, characterized for the presence of strong fading phenomena, differs from regular indoor and outdoor scenarios, posing multiple challenges for communication-aware robotics. In addition, accurate localization is a problem in environments such as tunnels or pipes. These environments generally lack distinctive visual and/or structural features and are longer than they are wide in shape. Standard indoor localization techniques do not perform well in pipelines or tunnels given the lack of exploitable features, while outdoor techniques (GPS in particular) do not work in these scenarios. In this thesis, we address basic robotics-related problems in order to provide some tools necessary for robotics exploration in tunnel-like scenarios under connectivity constraints. In the first part, we characterize, in terms of propagation, two of the most common tunnel-like environments: a pipe and a tunnel. We emphasize the spatial-fadings phenomena, as it is one of the most relevant issues to deal with, in a communications context. Secondly, we present a navigation strategy to deploy a team of robots for tunnel exploration, in particular maintaining network connectivity in the presence of these fadings. Several experiments conducted in a tunnel allow us to validate the connectivity maintenance of the system. Next, we address the localization problem and propose a technique that uses the periodicity of the fadings to estimate the position of the robots from the base station. The method is validated in small-scale and large-scale pipes. Finally, we propose spatial diversity schemes in order to ease the navigation while improving the localization

Aeronautical Engineering: A special bibliography, supplement 60

This bibliography lists 284 reports, articles, and other documents introduced into the NASA scientific and technical information system in July 1975