Dissertations / Theses on the topic 'Mobile and static robots'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Mobile and static robots.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
CALMINDER, SIMON, and CHITTUM MATTHEW KÄLLSTRÖM. "Object Tracking and Interception System : Mobile Object Catching Robot using Static Stereo Vision." Thesis, KTH, Mekatronik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-233135.
Full textI detta projekt behandlas konstruktionen av och pålitligheten i en bollfånganderobot och dess bakomliggande lågbudgetkamerasystem. För att fungera i tre dimensioner används en stereokameramodul som spårar bollen med hjälp av färgigenkänning och beräknar bollbanan samt förutspår nedslaget för att ge god tid till roboten att genskjuta bollen. Två olika bollbanemodeller testas, där den ena tar hänsyn till luftmotståndet och nedslaget beräknas numeriskt och den andra anpassar en andragradspolynom till de observerade datapunkterna. För att styra roboten till den tänkta uppfångningspunkten behövs både robotens position, vilket bestäms med kameramodulen, och robotens riktning.Riktningen bestäms medbåde en magnetometer och med kameramodulen, för att undersöka vilken metod som passar bäst. Den förslagna konstruktionen för roboten och kamerasystemet kan spåra och fånga objekt med bådadera de testade modellerna för att beräkna bollbana, dock så är tillförlitligheten i den numeriska metoden betydligt känsligare för dåliga mätvärden. Det är även möjligt att använda sig av både magnetometern eller endast kameramodulen för att bestämma robotens riktning då båda ger ett fel under 1.5°.
Hichri, Bassem. "Design and control of collaborative, cross and carry mobile robots : C3Bots." Thesis, Clermont-Ferrand 2, 2015. http://www.theses.fr/2015CLF22601/document.
Full textOur goal in the proposed work is to design and control a group of similar mobile robots with a simple architecture, called m-bot. Several m-bots can grip a payload, in order to co-manipulate and transport it, whatever its shape and mass. The resulting robot is called a p-bot andis capable to solve the so-called "removal-man task" to transport a payload. Reconfiguring the p-bot by adjusting the number of m-bots allows to manipulate heavy objects and to manage objects with anyshape, particularly if they are larger than a single m-bot. Obstacle avoidance is addressed and mechanical stability of the p-bot and its payload is permanently guaranteed. A proposed kinematic architecture for a manipulation mechanism is studied. This mechanism allows to lift a payload and put it on them-bot body in order to be transported. The mobile platform has a free steering motion allowing the system maneuver in any direction. An optimal positioning of the m-bots around the payload ensures a successful task achievement without loss of stability for the overall system. The positioning algorithm respects the Force Closure Grasping (FCG) criterion which ensures the payload stability during the manipulation phase. It respects also the Static Stability Margin (SSM) criterion which guarantees the payload stability during the transport. Finally, it considers also the Restricted Areas (RA) that could not be reached by the robots to grab the payload. A predefined control law is then used to ensure the Target Reaching (TR) phase of each m-bot to its desired position around the payload and to track a Virtual Structure (VS), during the transportation phase, in which each elementary robot has to keep the desired position relative to the payload. Simulation results for an object of any shape, described by aparametric curve, are presented. Additional 3D simulation results with a multi-body dynamic software and experiments by manufactured prototypes validate our proposal
Engwirda, Anthony, and N/A. "Self-Reliance Guidelines for Large Scale Robot Colonies." Griffith University. Griffith School of Engineering, 2007. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20070913.100750.
Full textEngwirda, Anthony. "Self-Reliance Guidelines for Large Scale Robot Colonies." Thesis, Griffith University, 2007. http://hdl.handle.net/10072/368079.
Full textThesis (PhD Doctorate)
Doctor of Philosophy (PhD)
Griffith School of Engineering
Faculty of Engineering and Information Technology
Full Text
Obšil, Tomáš. "Návrh dokovací stanice pro mobilní robot." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2018. http://www.nusl.cz/ntk/nusl-378718.
Full textMagalhães, André Chaves. "Planejamento cinemático-dinâmico de movimento com desvio local de obstáculos utilizando malhas de estados." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/18/18153/tde-19072013-105251/.
Full textMotion planning aims to determine which movements the robot must accomplish to reach a desired position or configuration in the environment without the occurrence of collisions with obstacles. It is common in mobile robotics to simplify the motion planning representing the robot by the coordinates of its center of gravity and ignoring any kinematic and dynamic constraint motion. However, most mobile robots have non-holonomic kinematic constraints, and for some tasks and robots, it is important to consider these constraints together with the dynamic model of the robot in task planning. Thus it is possible to determine a path that can actually be followed by the robot. Here we propose a method for kinematic-dynamic path planning using lattice states. This approach considers the kinematic and dynamic of the robot to generate generate feasible trajectories free of collisions with obstacles. When obstacles not represented on the map are detected by the sensors of the robot, a new trajectory is generated to avoid these obstacles. The motion planning using lattice state was associated with an obstacle avoidance algorithm based on the dynamic window approach (DWA). This method is responsible for trajectory tracking to ensure safety in navigation tasks. This method was applied in two distinct platforms. These platforms were used for navigation tasks in both indoor and outdoor simulated environments, as well as, in real environments. For navigation in indoor environments we used a Pioneer 3AT robot and for outdoor navigation we used the autonomous electric vehicle CaRINA1 being developed at ICMC-USP with support National Institute of Science and Technology in Critical Embedded Systems (INCT-SEC).
Zaccaria, Federico. "Geometrico-static modelling of continuum parallel robots." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020.
Find full textHähnel, Dirk. "Mapping with mobile robots." [S.l. : s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=974035599.
Full textPronobis, Andrzej. "Semantic Mapping with Mobile Robots." Doctoral thesis, KTH, Datorseende och robotik, CVAP, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-34171.
Full textQC 20110527
Classon, Johan. "Map Building using Mobile Robots." Thesis, KTH, Reglerteknik, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-107504.
Full textFredriksson, Håkan. "Navigation sensors for mobile robots /." Luleå : Luleå University of Technology, 2007. http://epubl.ltu.se/1402-1757/2007/54/.
Full textTrincavelli, Marco. "Gas discrimination for mobile robots." Doctoral thesis, Örebro universitet, Akademin för naturvetenskap och teknik, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-11901.
Full textKeepence, B. S. "Navigation of autonomous mobile robots." Thesis, Cardiff University, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.304921.
Full textAwadalla, Medhat Hussein Ahmed. "Adaptive co-operative mobile robots." Thesis, Cardiff University, 2005. http://orca.cf.ac.uk/56006/.
Full textFredriksson, Håkan. "Navigation sensors for mobile robots." Licentiate thesis, Luleå tekniska universitet, EISLAB, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-25771.
Full textGodkänd; 2007; 20071113 (ysko)
CASTT - Centre for Automotive Systems Technologies and Testing
Sá, André Filipe Marques Alves de. "Navigation of autonomous mobile robots." Master's thesis, Universidade de Aveiro, 2017. http://hdl.handle.net/10773/23832.
Full textAutomação, na mais simples das designações, é a arte de criar vida na máquina, possibilitando certas ações sem controlo directo por parte de um utilizador. Esta área de estudo permite que certas atividades que consideramos aborrecidas ou perigosas possam ser executadas por máquinas. Nesta tese, um estudo do estado da arte no campo de robôs móveis e inteligentes foi realizado, apresentando um focus especial em algoritmos de navegação baseados em procura e amostragem. Uma simulação foi desenvolvida, na qual um modelo do robô Wiserobot foi criado, utilizado como ambiente de teste um ed cio conhecido no campo da robótica, o laboratório da Willow Garage. Nesta simulação foram realizados testes aos algoritmos explorados anteriormente, nomeadamente Dijkstra, PRM e RRT. Para testar os algoritmos por amostragem, um plug-in foi desenvolvido para utilizar a Open Motion Planning Library para avaliar resultados dos mesmos. Por fim, código foi desenvolvido, usando e tendo por base bibliotecas existentes no ROS, de modo a dar ao nosso modelo do robô capacidades de navegação no ambiente simulado, inicialmente estático seguido de testes com objectos não declarados. Os resultados dos vários planeadores foram comparados para avaliar a prestação nos casos de testes definidos, utilizando métricas escolhidas previamente.
Automation, in the simplest of designations, is the art of creating life in the machine, allowing the performance of certain actions without the need of direct control by an user. This area of study allows for certain activities that we deem as tedious or dangerous to be executed by machines. In this thesis, a study of the state of the art in the eld of mobile and autonomous robotics is made, focusing in navigation algorithms based on search and sampling. A simulation was developed, in which a model of the robot was created, to be used with an environment well know by roboticist, Willow Garage. In this simulation, tests were made to the algorithms explored earlier, namely Dijkstra, PRM and RRT. To test multiple samplebased planners, a plug-in was developed to use the Open Motion Planning Library for benchmarking purposes. Finally code is developed, based and using existing ROS packages, to give a model cargo robot navigation capabilities in a simulated indoor environment, initially static then with undeclared obstacles. The results were compared from multiple planners to evaluate the performance in the test cases de ned, using pre-established metrics.
Rajaie, Hamid Reza. "Distributed architecture for mobile robots." Aachen Shaker, 2008. http://d-nb.info/997891661/04.
Full textČepl, Miroslav. "Návrh a implementace autonomního dokování mobilního robotu." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2019. http://www.nusl.cz/ntk/nusl-399409.
Full textAndrade-Cetto, Juan. "Environment learning for indoor mobile robots." Doctoral thesis, Universitat Politècnica de Catalunya, 2003. http://hdl.handle.net/10803/6185.
Full textS'estudien els fonaments matemàtics necessaris per a l'extracció de característiques a partir d'imatges i registres d'un làser, els quals permeten la identificació unívoca dels elements de l'entorn. Els atributs extrets a partir del senyal d'un sol sensor poden ser insuficients quan es volen caracteritzar els elements de l'entorn de forma invariant; això es pot millorar combinant informació de múltiples fonts. Es presenta un nou algorisme per la fusió d'informació complementaria extreta de dos mòduls de visió de baix nivell.
Aquesta fusió d'informació produeix descripcions més completes dels objectes de l'entorn, els quals poden ser seguits i apresos dins el context de la robòtica mòbil. Les variacions en les condicions d'il·luminació i les oclusions fan que l'associació de dades en visió per computador sigui una tasca difícil de completar.
Tot i això, l'ús de restriccions geomètriques i fotogramètriques permeten reduir la cerca de correspondències entre imatges successives; i al centrar l'atenció en un reduït nombre de característiques, aquestes poden ser seguides en imatges successives, simplificant així el problema d'associació de dades. Es recalquen les tècniques de la geometria de múltiples vistes que són rellevants pel còmput d'una estimació inicial de la posició dels elements de l'entorn, el que permet la reconstrucció del moviment del robot entre imatges successives; situació desitjable quan no existeix odometria o quan las seves lectures són poc fiables.
Quan els elements de l'entorn s'han extret i identificat, la segona part del problema consisteix en utilitzar aquestes observacions tant per estimar la posició del robot, com per refinar l'estimació dels mateixos elements de l'entorn. El moviment del robot i les lectures dels sensors es consideren com dos processos estocàstics, i el problema es tracta des del punt de vista de la teoria d'estimació, on el soroll inherent als sensors i al moviment del robot es consideren com a seqüències aleatòries.
El principal inconvenient existent en l'ús de tècniques d'estimació pel còmput concurrent de la posició del robot i la construcció d'un mapa, és que fins ara s'ha considerat la seva aplicació únicament en entorns estàtics, i que el seu ús en situacions més realistes ofereix poca robustesa. Es proposa un conjunt de funcions per avaluar la qualitat temporal de les observacions per tal de resoldre les situacions en que les observacions dels elements de l'entorn no siguin consistents en el temps. Es mostra com la utilització d'aquestes proves de qualitat temporal conjuntament amb les proves de compatibilitat espacial milloren els resultats quan es fen servir amb un mètode d'estimació òptima de la construcció concurrent de mapes i l'autolocalització de robots.
La idea principal consisteix en emprar un històric dels errors en l'associació de les dades per calcular la possibilitat d'incórrer en nous errors d'associació; i excloure del mapa aquells elements dels quals les observacions no siguin consistents.
Es posa especial atenció en el fet que l'eliminació dels elements inconsistents del mapa no violi les propietats dels algorismes de construcció concurrent de mapes i autolocalització descrits en la literatura; és a dir, convergència assimptòtica i correlació completa.
Aquesta tesi proporciona també un profund anàlisi del model de construcció concurrent de mapes i autolocalització totalment correlat des d'un punt de vista de la teoria de control de sistemes. Partint del fet que el filtre de Kalman no és més que un estimador òptim, s'analitzen les implicacions de tenir un vector d'estats que es revisa a partir de mesures totalment correladas.
Es revela de manera teòrica i amb experiments les limitacions d'utilitzar un enfocament per la construcció concurrent de mapes i l'autolocalització a partir de mesures totalment correladas.
El fet de tenir un model parcialment observable inhibeix la reconstrucció total de l'espai d'estats, produint tant mateix una estimació de la posició dels elements de l'entorn que depèn en tot cas de les observacions inicials, i que no garanteix la convergència a una matriu de covariància definida positivament.
D'altra banda, el fet de tenir un vector d'estats parcialment controlable fa que, desprès d'un reduït nombre d'iteracions el filtre cregui tenir una estimació perfecta de l'estat dels elements de l'entorn; amb els corresponents guanys de Kalman convergint a zero. Per tant, desprès d'un reduït nombre d'iteracions del filtre, els innovacions no s'utilitzen més. Es mostra com reduir els efectes de la correlació total i de la controlabilitat parcial. A més a més, suposant que el filtre de Kalman és un observador òptim per a la reconstrucció dels estats, és pertinent construir un regulador òptim que permeti conduir el robot el més a prop possible a una trajectòria desitjada durant la construcció d'un mapa. Es mostra com la dualitat existent entre l'observabilitat i la controlabilitat es pot fer servir en el disseny d'aquest regulador òptim.
Qualsevol algorisme de construcció concurrent de mapes i autolocalització de robots mòbils que s'ha d'usar en un entorn real ha de ser capaç de relacionar les observacions i els seus corresponents elements del mapa de manera expedita. Algunes de les proves de compatibilitat de les observacions són costoses des del punt de vista de la seva complexitat computacional, i la seva aplicació s'ha de dissenyar amb especial atenció. Es comenten els costos computacionals de les diferents proves de compatibilitat entre observacions; així com altres característiques desitjables de l'estructura de dades que es fa servir per a la construcció del mapa. A més a més es proposen una sèrie de tasques que han de realitzar-se durant l'associació de dades. Començant per les proves de compatibilitat amb un model bàsic dels elements del mapa, i continuant amb la reducció de l'espai de cerca quan es generen hipòtesis d'associació, així com les proves espacial i temporal d'associació de dades.
El treball que es presenta en aquesta tesi proposa noves tècniques en àrees de l'enginyera i ciències computacionals, que van des de nous algorismes per la visió per computador, a idees novells de la construcció concurrent de mapes i l'autolocalització de robots mòbils. Les contribucions principals són la proposta d'una nova tècnica per la fusió de dades visuals; la formulació d'un nou algorisme per la construcció concurrent de mapes i l'autolocalització de robots que considera la qualitat temporal dels elements del mapa; nous resultats teòrics en el nivell de reconstrucció possible quan es construeixen mapes a partir d'observacions totalment correladas; i les tècniques necessàries per pal·liar els efectes de l'observabilitat i la controlabilitat parcials, així com els efectes de les no linealitats en la solució del problema de construcció concurrent de mapes i de l'autolocalització.
Esta tesis aborda el problema del aprendizaje automático de entornos estructurados en robótica móvil. Particularmente, la extracción de características a partir de las se nales de los censores, la construcción autónoma de mapas, y la autolocalización de robots.
Se estudian los fundamentos matemáticos necesarios para la extracción de características a partir de imágenes y registros de un láser, las cuales permiten la identificación unívoca de los elementos del entorno. Los atributos extraídos a partir de la se nal de un solo sensor pueden ser insuficientes a la hora de caracterizar los elementos del entorno de forma invariante; lo que conlleva a la combinación de información de múltiples fuentes. Se presenta un nuevo algoritmo para la fusión de información complementaria extraída de dos módulos de visión de bajo nivel. Esta fusión de información produce descripciones más completas de los objetos presentes en el entorno, los cuales pueden ser seguidos y aprendidos en el contexto de la robótica móvil.
Las variaciones en las condiciones de iluminación y las oclusiones hacen que la asociación de datos en visión por computador sea una tarea difícil de llevar a cabo. Sin embargo, el uso de restricciones geométricas y fotogramétricas permiten reducir la búsqueda de correspondencias entre imágenes; y al centrar la atención en un reducido número de características, estas pueden ser seguidas en imágenes sucesivas, simplificando así el problema de asociación de datos. Se hace hincapié en las técnicas de la geometría de múltiples vistas relevantes para el cómputo de una estimación inicial de la posición de los elementos del entorno, lo cual permite la reconstrucción del movimiento
del robot entre imágenes sucesivas; situación deseable cuando se carece de odometría o cuando sus lecturas son poco fiables.
Una vez que los elementos del entorno han sido extraídos e identificados, la segunda parte del problema consiste en usar estas observaciones tanto para estimar la posición del robot, como para refinar la estimación de los mismos elementos del entorno. El movimiento del robot y las lecturas de los sensores se consideran como dos procesos estocásticos, y el problema se aborda desde el punto de vista de la teoría de estimación, en donde el ruido inherente a los sensores y al movimiento del robot se consideran como secuencias aleatorias.
La principal desventaja existente en el uso de técnicas de estimación para el cómputo concurrente de la posición del robot y la construcción de un mapa, es que hasta ahora se ha considerado su uso en entornos estáticos únicamente, y que su aplicación en situaciones más realistas carece de robustez.
Se propone un conjunto de funciones para evaluar la calidad temporal de las observaciones con el fin de solventar aquellas situaciones en que las observaciones de los elementos del entorno no sean consistentes en el tiempo.
Se muestra como el uso de estas pruebas de calidad temporal junto con las pruebas de compatibilidad espacial existentes mejora los resultados al usar un método de estimación óptima para la construcción concurrente de mapas y la autolocalización de robots. La idea principal consiste en usar un histórico
de los errores en la asociación de datos para el cómputo de la posibilidad de incurrir en nuevos errores de asociación; y eliminar del mapa aquellos elementos cuyas observaciones no sean consistentes.
Se presta especial atención a que la eliminación de elementos inconsistentes del mapa no viole las propiedades de los algoritmos de construcción concurrente de mapas y autolocalización descritos en la literatura; es decir, convergencia asintótica y correlación completa.
Esta tesis proporciona a su vez un análisis en profundidad del modelo de construcción concurrente de mapas y autolocalización totalmente correlado desde un punto de vista de la teoría de control de sistemas. Partiendo del hecho de que el filtro de Kalman no es otra cosa que un estimador óptimo, se analizan las implicaciones de tener un vector de estados que se revisa a partir de mediciones totalmente correladas. Se revela de forma teórica y con experimentos las limitaciones de usar un enfoque para la construcción concurrente de mapas y autolocalización a partir de mediciones totalmente correladas.
El hecho de tener un modelo parcialmente observable inhibe la reconstrucción total del espacio de estados, produciendo a su vez una estimación de la posición de los elementos del entorno que dependerá en todo caso de las observaciones iniciales, y que no garantiza la convergencia a una matriz de covarianza positivamente definida. Por otro lado, el hecho de tener un vector de estados parcialmente controlable, produce después de un reducido número de iteraciones que el filtro crea tener una estimación perfecta del estado de los elementos del entorno; con sus correspondientes ganancias de Kalman convergiendo a cero. Esto es, después de un peque no número de iteraciones del filtro, las innovaciones no se usan. Se muestra como reducir los efectos de la correlación total y la controlabilidad parcial. Además, dado que el filtro de Kalman es un observador óptimo para la reconstrucción de los estados, es pertinente construir un regulador óptimo que permita conducir al robot lo más cerca posible de una trayectoria deseada durante la construcción de un mapa. Se muestra como la dualidad existente entre la observabilidad y la controlabilidad se puede emplear en el diseño de este regulador óptimo.
Cualquier algoritmo de construcción concurrente de mapas y autolocalización de robots móviles que deba funcionar en un entorno real deberá ser capaz de relacionar las observaciones y sus correspondientes elementos del mapa de manera expedita. Algunas de las pruebas de compatibilidad de las observaciones son caras desde el punto de vista de su complejidad computacional, y su aplicación debe diseñarse con riguroso cuidado. Se comentan los costes computacionales de las distintas pruebas de compatibilidad entre observaciones; así como otras características deseadas de la estructura de datos elegida para la construcción del mapa. Además, se propone una serie de tareas que debe llevarse a cabo durante la asociación de datos. Partiendo por las pruebas de compatibilidad con un modelo básico de los elementos del mapa, y continuando con la reducción del espacio de búsqueda al generar hipótesis de asociación, así como las pruebas espacial y temporal de asociación de datos.
El trabajo que se presenta en esta tesis propone nuevas técnicas en áreas de la ingeniería y las ciencias computacionales, que van desde nuevos algoritmos de visión por computador, a ideas noveles en la construcción concurrente de mapas y la autolocalización de robots móviles. Las contribuciones principales son la propuesta de una nueva técnica para la fusión de datos visuales; la formulación de un nuevo algoritmo para la construcción concurrente de mapas y autolocalización de robots que toma en cuenta la calidad temporal de los elementos del mapa; nuevos resultados teóricos en el grado de reconstrucción posible al construir mapas a partir de observaciones totalmente correladas; y las técnicas necesarias para paliar los efectos de la observabilidad y controlabilidad parciales, así como los efectos de las no linealidades en la solución del problema de construcción concurrente de mapas y autolocalización.
This thesis focuses on the various aspects of autonomous environment learning for indoor service robots. Particularly, on landmark extraction from sensor data, autonomous map building, and robot localization.
To univocally identify landmarks from sensor data, we study several landmark representations, and the mathematical foundation necessary to extract the features that build them from images and laser range data. The features extracted from just one sensor may not suce in the invariant characterization of landmarks and objects, pushing for the combination of information from multiple sources. We present a new algorithm that fuses complementary information from two low level vision modules into coherent object models that can be tracked and learned in a mobile robotics context. Illumination conditions and occlusions are the most prominent artifacts
that hinder data association in computer vision. By using photogrammetric and geometric constraints we restrict the search for landmark matches in successive images, and by locking our interest in one or a set of landmarks in the scene, we track those landmarks along successive frames, reducing considerably the data association problem. We concentrate on those tools from the geometry of multiple views that are relevant to the computation of initial landmark location estimates for coarse motion recovery; a desirable characteristic when odometry is not available or is highly unreliable.
Once landmarks are accurately extracted and identied, the second part of the problem is to use these observations for the localization of the robot, as well as the renement of the landmark location estimates. We consider robot motion and sensor observations as stochastic processes, and treat the problem from an estimation theoretic point of view, dealing with noise by using probabilistic methods.
The main drawback we encounter is that current estimation techniques have been devised for static environments, and that they lack robustness in more realistic situations. To aid in those situations in which landmark observations might not be consistent in time, we propose a new set of temporal landmark quality functions, and show how by incorporating these functions in the data association tests, the overall estimation-theoretic approach to map building and localization is improved. The basic idea consists on using the history of data association mismatches for the computation of the likelihood of future data association, together with the spatial compatibility tests already available.
Special attention is paid in that the removal of spurious landmarks from the map does not violate the basic convergence properties of the localization and map building algorithms already described in the literature; namely, asymptotic convergence and full correlation.
The thesis also gives an in depth analysis of the fully correlated model to localization and map building from a control systems theory point of view. Considering the fact that the Kalman .lter is nothing else but an optimal observer, we analyze the implications of having a state vector that is being revised by fully correlated noise measurements. We end up revealing
theoretically and with experiments the strong limitations of using a fully correlated noise driven estimation theoretic approach to map building and localization in relation to the total number of landmarks used.
Partial observability hinders full reconstructibility of the state space, making the .nal map estimate dependant on the initial observations, and does not guarantee convergence to a positive de nite covariance matrix. Partial controllability on the other hand, makes the .lter beleive after a number of iterations, that it has accurate estimates of the landmark states, with their corresponding Kalman gains converging to zero. That is, after a few steps, innovations are useless. We show how to palliate the e.ects of full correlation
and partial controllability. Furthermore, given that the Kalman .lter is an optimal observer for the reconstruction of fully correlated states; it seems pertinent to build an optimal regulator in order to keep the robot as close as possible to a desired motion path when building a map. We show also how the duality between observability and controllability can be exploited in designing such an optimal regulator.
Any map building and localization algorithm for mobile robotics that is to work in real time must be able to relate observations and model matches in an expeditious way. Some of the landmark compatibility tests are computationally expensive, and their application has to be carefully designed. We touch upon the time complexity issues of the various landmark compatibility tests used, and also on the desirable properties of our chosen map data structure.
Furthermore, we propose a series of tasks that must be handled when dealing with landmark data association. From model compatibility tests, to search space reduction and hypothesis formation, to the actual association of observations and models.
The work presented in this thesis spans several areas of engineering and computer science, from new computer vision algorithms, to novel ideas in mobile robot localization and map building. The key contributions are the proposal of a new technique to fuse visual data; the formulation of new algorithms to concurrent localization and map building that take into account temporal landmark quality; new theoretical results on the degree of reconstruction possible when building maps from fully correlated observations; and the necessary techniques to palliate partial observability, partial controllability, and the nonlinear e.ects when solving the simultaneous localization and map building problem.
Holmberg, Per. "Sensor Fusion with Coordinated Mobile Robots." Thesis, Linköping University, Department of Electrical Engineering, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1717.
Full textRobust localization is a prerequisite for mobile robot autonomy. In many situations the GPS signal is not available and thus an additional localization system is required. A simple approach is to apply localization based on dead reckoning by use of wheel encoders but it results in large estimation errors. With exteroceptive sensors such as a laser range finder natural landmarks in the environment of the robot can be extracted from raw range data. Landmarks are extracted with the Hough transform and a recursive line segment algorithm. By applying data association and Kalman filtering along with process models the landmarks can be used in combination with wheel encoders for estimating the global position of the robot. If several robots can cooperate better position estimates are to be expected because robots can be seen as mobile landmarks and one robot can supervise the movement of another. The centralized Kalman filter presented in this master thesis systematically treats robots and extracted landmarks such that benefits from several robots are utilized. Experiments in different indoor environments with two different robots show that long distances can be traveled while the positional uncertainty is kept low. The benefit from cooperating robots in the sense of reduced positional uncertainty is also shown in an experiment.
Except for localization algorithms a typical autonomous robot task in the form of change detection is solved. The change detection method, which requires robust localization, is aimed to be used for surveillance. The implemented algorithm accounts for measurement- and positional uncertainty when determining whether something in the environment has changed. Consecutive true changes as well as sporadic false changes are detected in an illustrative experiment.
Chen, Ian Yen-Hung. "Mixed reality simulation for mobile robots." Thesis, University of Auckland, 2011. http://hdl.handle.net/2292/7128.
Full textKatsilieris, Fotios. "Search and secure using mobile robots." Thesis, KTH, Reglerteknik, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-105718.
Full textSafdar, Wasim, and Vlad Bădăluță. "Visual Navigation System for Mobile robots." Thesis, Högskolan i Halmstad, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-15595.
Full textBrind'Amour, Francois. "Navigation sensor for collaborative mobile robots." Thesis, University of Ottawa (Canada), 2005. http://hdl.handle.net/10393/26860.
Full textGregoire, Jean. "Priority-based coordination of mobile robots." Thesis, Paris, ENMP, 2014. http://www.theses.fr/2014ENMP0023/document.
Full textSince the end of the 1980's, the development of self-driven autonomous vehicles is an intensive research area in most major industrial countries. Positive socio-economic potential impacts include a decrease of crashes, a reduction of travel times, energy efficiency improvements, and a reduced need of costly physical infrastructure. Some form of vehicle-to-vehicle and/or vehicle-to-infrastructure cooperation is required to ensure a safe and efficient global transportation system. This thesis deals with a particular form of cooperation by studying the problem of coordinating multiple mobile robots at an intersection area. Most of coordination systems proposed in previous work consist of planning a trajectory and to control the robots along the planned trajectory: that is the plan-as-program paradigm where planning is considered as a generative mechanism of action. The approach of the thesis is to plan priorities – the relative order of robots to go through the intersection – which is much weaker as many trajectories respect the same priorities. Then, priorities are merely used as a coordination resource to guide robots through the intersection. Once priorities are assigned, robots are controlled through a control law preserving the assigned priorities. It results in a more robust coordination system – able to handle a large class of unexpected events in a reactive manner – particularly well adapted for an application to the coordination of autonomous vehicles at intersections where cars, public transport and pedestrians share the road
Maalouf, Elie. "Nonlinear control of wheeled mobile robots." Mémoire, Montréal : École de technologie supérieure, 2005. http://wwwlib.umi.com/cr/etsmtl/fullcit?pMR06031.
Full text"Thesis presented to École de technologie supérieure as a partial requirement to obtain a masters in electrical engineering". Bibliogr.: f. [140]-142. Également disponible en version électronique.
Carter, Brian Edward. "Omni-directional locomotion for mobile robots." Ohio : Ohio University, 2001. http://www.ohiolink.edu/etd/view.cgi?ohiou1173804459.
Full textPace, Conrad J. "Autonomous safety management for mobile robots." Thesis, Lancaster University, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.423907.
Full textSeward, Derek William. "The development of intelligent mobile robots." Thesis, Lancaster University, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.301085.
Full textMelhuish, C. R. "Strategies for collective minimalist mobile robots." Thesis, University of the West of England, Bristol, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.265090.
Full textSumman, Rahul. "Positioning for mobile NDE inspection robots." Thesis, University of Strathclyde, 2012. http://oleg.lib.strath.ac.uk:80/R/?func=dbin-jump-full&object_id=20347.
Full textRasheed, Tahir. "Collaborative Mobile Cable-Driven Parallel Robots." Thesis, Ecole centrale de Nantes, 2019. http://www.theses.fr/2019ECDN0055.
Full textThis thesis presents a novel concept of Mobile Cable - Driven Parallel Robots (MCDPRs) as a new robotic system. MCDPR is composed of a classical C able - D riven P a rallel R obot (CDPR) mounted on multiple mobile bases. MCDPRs combines the autonomy of mobile robots with the advantages of CDPRs, namely, large workspace, high payload - to - weight ratio, low end - effector inertia, deployability and reconfigurability. Moreover , MCDPRs presents a new technical innovation that could help to bring more flexibility and versatility with respect to existing industrial robotic solutions. Two MCDPRs prototypes named FASTKIT and MoPICK have been developed during the course of this the sis. FASTKIT is composed of two mobile bases carrying a six degrees - of - freedom moving - platform, pulled by eight cables , with a goal to provide a low cost and versatile robotic solution for logistics. MoPICK is composed of a three degrees - of - freedom movi ng - platform pulled by four cables mounted on four mobile bases. The targeted applications of MoPICK are mobile tasks in a constrained environment, for example, a workshop or logistic operations in a warehouse. The contributions of this thesis are as follow s. Firstly, all the necessary conditions are studied that required to achieve the static equilibrium of a MCDPR . These conditions are used to develop a Tension Distribution Algorithm for the real time control of the MCDRP cables. The equilibrium conditions are also used to investigate the Wrench - Feasible - Workspace of MCDPRs. Afterwards, the kinematic performance and twist capabilities of the MCDPRs are investigated. Finally, the last part of the thesis presents multiple path planning strategies for MCDPRs i n order to reconfigure the CDPR’s geometric architecture for performing the desired task
Perko, Eric Michael. "Precision Navigation for Indoor Mobile Robots." Case Western Reserve University School of Graduate Studies / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=case1345513785.
Full textLuh, Cheng-Jye 1960. "Hierarchical modelling of mobile, seeing robots." Thesis, The University of Arizona, 1989. http://hdl.handle.net/10150/276998.
Full textCalkins, Joseph M. "Real-time compensation of static deflections in robotic manipulators." Thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-12052009-020254/.
Full textYuan, Han. "Static and dynamic stiffness analysis of cable-driven parallel robots." Thesis, Rennes, INSA, 2015. http://www.theses.fr/2015ISAR0003/document.
Full textThis thesis contributes to the analysis of the static and dynamic stiffness of cable-driven parallel robots (CDPRs) aiming to improve the static positioning accuracy and the trajectory tracking accuracy. The proposed static and dynamic cable modeling considers the effect of cable weight on the cable profile and the effect of cable mass on the cable dynamics. Based on the static cable model, the static pose error of the end-effector is defined and the variation of the end-effector pose error with the external load is used to evaluate the static stiffness of CDPRs. A new dynamic model of CDPRs is proposed with considering the coupling of the cable dynamics and the end-effector vibrations. Experimental validations are carried out on CDPR prototypes. Static experiments, modal experiments, free vibration experiments and trajectory experiments are performed. The proposed static and dynamic models are verified. Cable dynamics, robot dynamics and their coupling are discussed. Results show the relevance of the proposed models on improving the performances of CDPRs in terms of design and control. Besides stiffness analysis, the proposed models are applied on the force distribution of redundant actuated CDPRs. A new method on the calculation of the cable forces is proposed, where the determination of the lower-boundary of the cable forces is presented. The consideration of the pose-dependence of the lower force boundary can minimize the cable forces and improve the energy efficiency of CDPRs
Chronis, George. "Sketch-based navigation for mobile robots using qualitative landmark states." Diss., Columbia, Mo. : University of Missouri-Columbia, 2007. http://hdl.handle.net/10355/4651.
Full textThe entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on September 19, 2007) Vita. Includes bibliographical references.
Létourneau, Dominic. "Interprétation visuelle de symboles par un robot mobile." Sherbrooke : Université de Sherbrooke, 2002.
Find full textSedlák, Luboš. "Senzorický systém robotu Minidarpa." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2010. http://www.nusl.cz/ntk/nusl-218314.
Full textRamisa, Ayats Arnau. "Localization and Object Recognition for Mobile Robots." Doctoral thesis, Universitat Autònoma de Barcelona, 2009. http://hdl.handle.net/10803/3064.
Full textAlthough new approaches to enable robots with advanced cognitive capabilities are being developed, still few work is being devoted to a difficult problem in which all this techniques rely: fast and robust perception methods to detect semantically relevant elements in unstructured environments. Indeed, being able to identify the robot's location and what objects lie around constitute the foundations on which almost all high-level reasoning processes conducted by a robot will build up. In order to help reduce this gap, this work addresses the problems of vision-based global localization and object recognition. The first contributions presented are a new technique to construct signatures of places to be used as nodes of a topological map from constellations of features detected in panoramic images, and a homing method to travel between such nodes that does not rely in artificial landmarks. Both methods were tested with several datasets showing very good results. General object recognition in mobile robots is of primary importance in order to enhance the representation of the environment that robots will use for their reasoning processes. Therefore, the next contributions of the thesis address this problem. After carefully reviewing recent Computer Vision literature on this topic, two state of the art object recognition methods were selected: The SIFT object Recognition method and the Vocabulary Tree method. After evaluating both methods in challenging datasets, focusing on issues relevant to mobile robotics, it was found that, although the SIFT method was more suited for mobile robotics, both had complementary properties.To take advantage of this complementarity, the final contribution of this thesis is a Reinforcement Learning method to select online which object recognition method is best for an input image based on simple to compute image features. This method has been validated in a challenging object recognition experiment, even improving the performance of a human expert in some cases.
Keywords: Mobile Robotics; Vision-based localization; Object recognition; Visual Feature Detectors; Visual Feature Descriptors; Reinforcement Learning; Visual Homing
Wooden, David T. "Graph-based Path Planning for Mobile Robots." Diss., Available online, Georgia Institute of Technology, 2006, 2006. http://etd.gatech.edu/theses/available/etd-11092006-180958/.
Full textMagnus Egerstedt, Committee Chair ; Patricio Vela, Committee Member ; Ayanna Howard, Committee Member ; Tucker Balch, Committee Member ; Wayne Book, Committee Member.
Egerstedt, Magnus. "Motion planning and control of mobile robots." Doctoral thesis, KTH, Mathematics, 2000. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-2948.
Full textOrebäck, Anders. "A component framework for autonomous mobile robots." Doctoral thesis, KTH, Numerical Analysis and Computer Science, NADA, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-50.
Full textThe major problem of robotics research today is that there is a barrier to entry into robotics research. Robot system software is complex and a researcher that wishes to concentrate on one particular problem often needs to learn about details, dependencies and intricacies of the complete system. This is because a robot system needs several different modules that need to communicate and execute in parallel.
Today there is not much controlled comparisons of algorithms and solutions for a given task, which is the standard scientific method of other sciences. There is also very little sharing between groups and projects, requiring code to be written from scratch over and over again.
This thesis proposes a general framework for robotics. By examining successful systems and architectures of past and present, yields a number of key properties. Some of these are ease of use, modularity, portability and efficiency. Even though there is much consensus on that the hybrid deliberate/reactive is the best architectural model that the community has produced so far, a framework should not stipulate a specific architecture. Instead the framework should enable the building of different architectures. Such a scheme implies that the modules are seen as common peers and not divided into clients and servers or forced into a set layering.
Using a standardized middleware such as CORBA, efficient communication can be carried out between different platforms and languages. Middleware also provides network transparency which is valuable in distributed systems. Component-based Software Engineering (CBSE) is an approach that could solve many of the aforementioned problems. It enforces modularity which helps to manage complexity. Components can be developed in isolation, since algorithms are encapsulated in components where only the interfaces need to be known by other users. A complete system can be created by assembling components from different sources.
Comparisons and sharing can greatly benefit from CBSE. A component-based framework called ORCA has been implemented with the following characteristics. All communication is carried out be either of three communication patterns, query, send and push. Communication is done using CORBA, although most of the CORBA code is hidden for the developer and can in the future be replaced by other mechanisms. Objects are transported between components in the form of the CORBA valuetype.
A component model is specified that among other things include support for a state-machine. This also handles initialization and sets up communication. Configuration is achieved by the presence of an XML-file per component. A hardware abstraction scheme is specified that basically route the communication patterns right down to the hardware level.
The framework has been verified by the implementation of a number of working systems.
Minnema, Lindhé Magnus. "Communication-Aware Motion Planning for Mobile Robots." Doctoral thesis, KTH, Reglerteknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-58781.
Full textQC 20120117
Dag, Antymos. "Autonomous Indoor Navigation System for Mobile Robots." Thesis, Linköpings universitet, Programvara och system, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-129419.
Full textLi, Mengchan. "Spatial wireless connectivity prediction for mobile robots." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-183086.
Full textGuerrero, Pérez Pablo Alexis. "Bayesian Handling of Uncertainty For Mobile Robots." Tesis, Universidad de Chile, 2011. http://www.repositorio.uchile.cl/handle/2250/102531.
Full textSlack, Marc G. "Situationally driven local navigation for mobile robots." Diss., This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-07282008-135258/.
Full textPanimadai, Ramaswamy Shweta Annapurani. "Formation control of car-like mobile robots." Diss., Rolla, Mo. : Missouri University of Science and Technology, 2008. http://scholarsmine.mst.edu/thesis/pdf/Panimadai_Ramaswamy_09007dcc804aeda1.pdf.
Full textVita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed April 14, 2008) Includes bibliographical references (p. 119-121).
Axelsson, Henrik. "Hybrid control of multiple autonomous mobile robots." Thesis, Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/15439.
Full text