To see the other types of publications on this topic, follow the link: Mobius Groups.
Dissertations / Theses on the topic 'Mobius Groups'
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 'Mobius Groups.'
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.
1
Downs, M. L. N. "Mobius inversion of some classical groups and their application to the enumeration of regular hypermaps." Thesis, University of Southampton, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.381232.
Full text
2
Kobosko, Kristoffer, and Henrik Wallentin. "Mobile Groups in Ad-hoc Networks." Thesis, Uppsala University, Department of Information Technology, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-108036.
Full textAbstract:
Most current research on Mobile Ad-hoc NETworks (MANETs) concerns one ad-hocnetwork at a time. A common topic is how to handle the merging of new nodesappearing in range of an existing MANET into a new, larger network. CurrentMANET implementations do not define the handling of policies for controllingmembership or routing messages, neither do they support policy-based inter-MANETrouting.
In this thesis, we present an implementation of Mobile Group Protocol (MGP) whichenhances the reactive routing protocol AODV with an administrative framework inwhich Mobile Ad-hoc NETwork (MANET) policies are defined. Such policies are usedto control membership and signaling in a MANET. We define new roles for theMANET members such as nodes, leaders and gateways. We discuss the messageexchange taking place during forming of Mobile Groups (MGs) and study the theparticular implementation by simulating a group of simple MGP scenarios usingNetwork Simulator 2 (NS-2).
We conclude our work by discussing the using of MGP as a base for an inter-MANETrouting protocol providing policy-based routing in MANETs.
3
Sproul, Michael D. "Building believers and reaching unbelievers in a young, mobile, and ethnically diverse community through the use of small groups a model for the military chaplain /." Theological Research Exchange Network (TREN) Access this title online, 1995. http://www.tren.com/search.cfm?p066-0003.
Full text
4
Walther, Ulrich. "Service support for virtual groups in mobile environments /." Aachen : Shaker, 2003. http://www.gbv.de/dms/bs/toc/377762105.pdf.
Full text
5
Damers, Julien. "Lie groups applied to localisation of mobile robots." Electronic Thesis or Diss., Brest, École nationale supérieure de techniques avancées Bretagne, 2022. http://www.theses.fr/2022ENTA0007.
Full textAbstract:
Dans le cadre du développement des énergies renouvelables, les activités offshores liées aux parcs éoliens ont grandement augmenté en nombre. Ainsi les coûts de maintenance et de surveillance de telles structures aussi bien en hommes qu'en moyens se sont accrus et cette tendance s'amplifiera sûrement au cours des prochaines années. Ceci a encouragé le développement des véhicules sous-marins autonomes (AUV). Ceux-ci sont encore très coûteux du fait des capteurs onéreux qu'ils embarquent. Ils sont donc encore rares, ce qui ne suffit pas à combler les actuels besoins. Ainsi le développement d'AUVs à bas-coût est un sujet de recherche en forte croissance. C'est dans ce champ de recherche que cette thèse vient s'inscrire. Un des problèmes principaux rencontré en robotique sous-marine est la localisation de l'engin. C'est la résolution de celui-ci qui nous servira d’objectif tout au long de ce travail. Pour ce faire, une nouvelle méthode d'intégration garantie, robuste aux incertitudes sur les conditions initiales est présentées dans ce manuscrit. Celle-ci se base sur l'utilisation des symétries de Lie appliquées aux équations différentielles. Nous la présenterons en premier lieu sur un problème théorique simple avant de l’appliquer sur le problème de localisation d’un robot sous-marinWith the development of offshore activities, the costs of maintenance and monitoring of offshore plants in terms of crew members, boats, and money have greatly increased and are still growing dramatically. This encouraged the development of autonomous underwater vehicles (AUV). These are still very expensive because of the numerous high-end sensors they need to embark on to accomplish their missions. Thus their number is relatively low. Therefore research is made to develop low-cost AUVs that could be produced in a larger amount to perform the same missions. This thesis comes within the scope of this research field. One of the main problems when dealing with AUVs is the localisation of the vehicle which will be the one addressed throughout this work. To tackle it, we present a new guaranteed integration method, which is more robust to the uncertainties on the initial condition than the ones currently available, based on Lie symmetries. This method is first presented through different simple theoretical examples. We then apply it to a localisation problem in a robotic context
6
Seba, Lagraa Hamida. "Sécurité et tolérance aux fautes dans les environnements mobiles." Compiègne, 2003. http://www.theses.fr/2003COMP1476.
Full textAbstract:
Consensus et gestion de clés de groupe sont des problèmes de base dans la conception de systèmes sûrs de fonctionnement. Dans cette, thèse, nous proposons un nouveau protocole qui résout le problème du consensus dans un environnement mobile asynchrone sujet aux pannes et aux déconnexions de sites. Ensuite, nous utilisons cette solution pour développer un nouveau protocole de validation atomique destiné aux transactions mobiles et un service de groupe pour sites mobiles. Nous avons élaboré une synthèse des protocoles de gestion de clés de groupe existants. Cette étude a permis de mettre en évidence une nouvelle approche pour la gestion de clés basée sur les caractéristiques de groupes. Cette approche permet d'améliorer les performances de la gestion de clés. Nous proposons aussi, un nouveau protocole d'accord de clés tolérant aux défaillances. Ce protocole utilise des détecteurs de défaillances pour permettre à un maximum de membres de participer à l'établissement de la cléConsensus and group key management are fundamental problems in the design of dependable systems. Ln this thesis, we propose a new protocol that solves the consensus problem in an asynchronous mobile environment prone to failures and disconnections. Then, we use this solution to develop a new non-blocking atomic commitment protocol for mobile transactions and to build a group communication service for mobile hosts. We elaborated a state of the art on group key management protocols. This comparative study points out a new group key management approach based on group characteristics. This approach enhances the performance of group key management protocols. We also propose a new fault-tolerant group key management protocol that uses failure detectors to increase the number of participants to the key establishment process
7
Pérez, Tellez Adriel, and Jonas Roth. "Mobile autonomous ground vehicles." Thesis, KTH, Skolan för elektro- och systemteknik (EES), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-199348.
Full text
8
Walther, Ulrich [Verfasser]. "Service Support for Virtual Groups in Mobile Environments / Ulrich Walther." Aachen : Shaker, 2003. http://d-nb.info/1172609179/34.
Full text
9
Kitson, Michael E. "The Sex Pistols and the London mob." Thesis, View thesis, 2008. http://handle.uws.edu.au:8081/1959.7/38784.
Full textAbstract:
This thesis concerns the invention, improvisation, and right to ownership of the punk patent and questions the contention, put by the band’s manager, Malcolm McLaren, and other commentators, that the Sex Pistols and English punk were a Situationist prank. This challenge to what, in the majority of punk literature, has become an ‘accepted truth’ was first raised by McLaren’s nemesis, the band’s lead singer, John Lydon. McLaren and Lydon did agree that the London punk movement took its inspiration from the anarchic and chaotic energies of the eighteenth–century London mob. This common crowd could switch instantly and unpredictably from a passive state to an anarchic, violent and destructive mob, or ‘King Mob’: one that turned all authority on its head in concerted, but undirected, acts of misrule. Through his own improvisation with punk tropes, Lydon came to embody English punk and functioned, on the one hand, as a natural mob leader; and on the other, as a focus for the mob’s anger. I argue that, in following McLaren’s reduction of the Sex Pistols to a Situationistinspired prank, one of the earliest and most influential analyses of the punk phenomenon, Greil Marcus’s Lipstick Traces: A Secret History of the Twentieth Century, misunderstood how fundamental the culture and semiotics of the London mob was to McLaren, Lydon, the Sex Pistols and the performance of London punk. I take seriously, then, the idea that the cultural signifiers the Sex Pistols drew upon to make their punk performances, and which accounted in no small way for their ability to ‘outrage’, were exclusively British and unique to London’s cultural topography and the culture of the London crowd. After the implosion of the Sex Pistols on their 1978 American tour, with Lydon quitting in disgust, McLaren attempted to take ownership of the punk legacy: both actually, through attempting to assert his copyright over the Sex Pistols’ brand; and symbolically through re-writing the Sex Pistols’ story in his 1980 movie The Great Rock ‘n’ Roll Swindle. Curiously, and most notably, the mob is foregrounded in the film through its opening sequence, which draws heavily from the events of the Gordon Riots in 1780. This thesis contests the paradigm put in place by McLaren’s version of events as portrayed in The Great Rock ‘n’ Roll Swindle and reconsiders punk as a cultural object trouve. In particular, I consider literary influences on its protagonists: Graham Greene on John Lydon and Charles Dickens and J. M. Barrie on Malcolm McLaren.
10
Parviainen, Roland. "Large scale and mobile group communication systems." Doctoral thesis, Luleå tekniska universitet, Datavetenskap, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-26688.
Full textAbstract:
This doctoral thesis examines different attributes of large scale group communication systems such as scalability, security and mobility by studying two different prototype systems - mIR (multicast Interactive Radio) and MES (Mobile E-meeting Services). mIR is a system for large scale real-time music distribution, designed as an interactive radio system for the Internet. MES is a collection of tools for improving the use of e-meeting and video conferencing tools in a mobile environment. The mIR prototype has been used to study scalability and security. Scalability in mIR concerns how to support as many users as possible without degrading the experience. This is achieved using IP multicast together with algorithms that limits the bandwidth usage regardless of the number of users. The work on security have focused on copy prevention through digital watermarking. By adding a unique watermark, i.e. a fingerprint, to each media copy a pirated copy can be traced back to a specific user, which can act as a deterrent. The thesis shows how we can combine the different goals of fingerprinting and IP-multicast while still maintaining the scalability features of multicast. Many issues need to be considered if e-meetings and video conferencing will become widespread and popular. Scalability and security, discussed in the first part of the thesis are two examples, and the second part of the thesis tries to address a third issue: mobility. In particular we are interested in enabling access to an e-meeting in a mobile environment, where we often have difficult conditions such as bad network connections, the user only have access to the Internet through a web browser or the available devices are small and limited. In many cases it is currently impossible to participate in an e-meeting when you're not in the office. The prototype system developed in the second part of the thesis aims to enable participation from any location and device that have some sort of Internet connection. We try to achieve this by allowing a mobile user to access an e-meeting session from a web browser or from a Java enabled mobile phone. Further, the system makes it possible to review missed events in an e-meeting as it is likely that there are many times where no Internet connection at all is available. The general style of work has been prototype driven with a goal of creating usable prototypes - i.e. the prototypes should be easy to deploy and it should be possible to use and test the prototypes daily. Most the prototypes described in this thesis have indeed been deployed and have seen daily use.Godkänd; 2005; 20061004 (ysko)
11
Massin, Raphaël. "On the clustering of mobile ad hoc networks." Electronic Thesis or Diss., Paris, ENST, 2016. https://pastel.hal.science/tel-03689508.
Full textAbstract:
Cette thèse traite de la clustérisation des réseaux ad hoc mobiles. Ce mécanisme consiste à rassembler les noeuds du réseau en grappes appelés clusters, dans le but d'introduire de la hiérarchie dans le réseau, et ainsi de permettre son passage à l'échelle. L'objectif principal est de concevoir de nouveaux algorithmes distribués de clustérisation, adaptés aux réseaux non structurés, où tous les noeuds sont des pairs, ainsi qu'aux réseaux structurés, où il existe déjà une structure hiérarchique intrinsèque. Dans le but de permettre une allocation des ressources radio à l'intérieur des clusters plus efficace qu'entre les clusters, les algorithmes proposés forment des clusters qui satisfont certaines contraintes de topologie : la connectivité, une taille et un diamètre maximaux. Afin d'évaluer les performances de ces nouvelles solutions, comparativement à celles de la littérature, et de manière indépendante des mécanismes d'accès au canal radio employés, la première partie de la thèse introduit des fonctions de coût de réseau, qui incorporent le profil de trafic utilisateur ainsi que les coûts de communication intra-cluster. Ensuite, un algorithme distribué adapté aux réseaux structurés est proposé, et ses performances comparées par simulation à plusieurs autres solutions de la littérature. Une caractéristique originale de cet algorithme est qu'il ne fait pas appel à la notion de chef de cluster. Dans la dernière partie, grâce à la théorie des jeux de coalition nous revisitons l'algorithme précédemment proposé pour les réseaux structurés. Ce cadre théorique permet de formaliser le problème de la clustérisation dans un contexte plus général, et conduit à la définition d'un algorithme générique, applicable à tous types de réseaux, ainsi qu'à une meilleure connaissance théorique de ses propriétésThis thesis is about clustering of mobile ad hoc networks, which consists in building some sets of nodes, called clusters, in order to introduce hierarchy in the network and thus improve its scalability. The main goal is to design new distributed clustering algorithms suited to i) unstructured networks, where all the nodes are equal, and suited to ii) structured networks that have an inherent hierarchical structure, and in which the nodes are gathered in operational groups. In order to allow the implementation of a radio resource allocation process that is more efficient within clusters than between clusters, the proposed algorithms form clusters satisfying specific topology constraints: connectivity, maximum size and diameter. In the first part of the thesis, to compare these new solutions to the ones from the literature, independently to the medium access scheme, we introduce network cost functions which take into account the user traffic profil and the intra-cluster and inter-cluster communication costs. Then, we propose a distributed clustering algorithm suited to structured networks, and compare its performance to several clustering schemes from the literature. A salient feature of this algorithm is that it does not need to resort to the notion of cluster-head. In the last part, thanks to the coalition game theory we revisit this algorithm. This theoretical framework allows us to formalize the clustering problem in a more general context. This leads us to defining a generic algorithm suitable to any kind of ad hoc network, and enables us to acquire a better knowledge of its properties
12
Soltan, Othman A. "Efficiency improvements to the Groupe Special Mobile (GSM) digital mobile radio system." Thesis, Aston University, 1994. http://publications.aston.ac.uk/8060/.
Full textAbstract:
Groupe Spécial Mobile (GSM) has been developed as the pan-European second generation of digital mobile systems. GSM operates in the 900 MHz frequency band and employs digital technology instead of the analogue technology of its predecessors. Digital technology enables the GSM system to operate in much smaller zones in comparison with the analogue systems. The GSM system will offer greater roaming facilities to its subscribers, extended throughout the countries that have installed the system. The GSM system could be seen as a further enhancement to European integration. GSM has adopted a contention-based protocol for multipoint-to-point transmission. In particular, the slotted-ALOHA medium access protocol is used to coordinate the transmission of the channel request messages between the scattered mobile stations. Collision still happens when more than one mobile station having the same random reference number attempts to transmit on the same time-slot. In this research, a modified version of this protocol has been developed in order to reduce the number of collisions and hence increase the random access channel throughput compared to the existing protocol. The performance evaluation of the protocol has been carried out using simulation methods. Due to the growing demand for mobile radio telephony as well as for data services, optimal usage of the scarce availability radio spectrum is becoming increasingly important. In this research, a protocol has been developed whereby the number of transmitted information packets over the GSM system is increased without any additional increase of the allocated radio spectrum. Simulation results are presented to show the improvements achieved by the proposed protocol. Cellular mobile radio networks commonly respond to an increase in the service demand by using smaller coverage areas. As a result, the volume of the signalling exchanges increases. In this research, a proposal for interconnecting the various entitles of the mobile radio network over the future broadband networks based on the IEEE 802.6 Metropolitan Area Network (MAN) is outlined. Simulation results are presented to show the benefits achieved by interconnecting these entities over the broadband Networks.
13
Parthasarathy, Madhusoodan. "Routing in the presence of groups in MANETs." Pullman, Wash. : Washington State University, 2009. http://www.dissertations.wsu.edu/Thesis/Spring2009/m_parthasarathy_020409.pdf.
Full textAbstract:
Thesis (M.S. in computer science)--Washington State University, May 2009.Title from PDF title page (viewed on July 21, 2009). "School of Electrical Engineering and Computer Science." Includes bibliographical references (p. 113-117).
14
Guna, Stefan-Valentin. "On Neighbors, Groups and Application Invariants in Mobile Wireless Sensor Networks." Doctoral thesis, Università degli studi di Trento, 2011. https://hdl.handle.net/11572/367672.
Full textAbstract:
The miniaturization and energy-efficient operation of wireless sensor networks (WSNs) provides unprecedented opportunities for monitoring mobile entities. The motivation for this thesis is drawn from real-world applications including monitoring wildlife, assisted living, and logistics. Nevertheless, mobility unveils a series of problems that do not arise in fixed scenarios. Through applications, we distill three of those, as follows.
Neighbor discovery, or knowing the identity of surrounding nodes, is the precondition for any communication between nodes. As compared to other existing solutions, we provide a framework that approaches the problem from the perspectives of latency (the time required to detect an amount of contacts), lifetime (the time nodes are expected to last) and probability (the fraction of contacts guaranteed to be detected within a given latency). By formalizing neighbor discovery as an optimization problem, we obtain a significant improvement w.r.t. the state-of-art. We offer a solver providing the optimal configuration and an implementation for popular WSN devices.
Group membership, or knowing the identity of the transitively connected nodes, can be either the direct answer to a requirement (e.g., caring for people that are not self-sufficient), or a building-block for higher-level abstractions. Earlier works on the same problem target either less constrained devices such as PDAs or laptops or, when targeting WSN devices, provide only post-deployment information on the group. Instead, we provide three protocols that cover the solution space. All our protocols empower each node with a
run-time global view of the group composition.
Finally, we focus on the behavior of the processes monitored by WSNs. We present a system that validates whether global invariants describing the safe behavior of a monitored system are satisfied. Although similar problems have been tackled before, the invariants we target are more complex and our system evaluates them in the network, at run-time. We focus on invariants that are expressed as first-order logic formulas over the state of multiple nodes. The requirement for monitoring invariants arises in both fixed and mobile
environments; we design and implement an efficient solution for each. Noteworthy is that the solution targeting mobility bestows each node with an eventually consistent view on the satisfaction of the monitored invariants; in this context, the group membership algorithms play the role of global failure detectors.
15
Guna, Stefan-Valentin. "On Neighbors, Groups and Application Invariants in Mobile Wireless Sensor Networks." Doctoral thesis, University of Trento, 2011. http://eprints-phd.biblio.unitn.it/662/1/thesis.pdf.
Full textAbstract:
The miniaturization and energy-efficient operation of wireless sensor networks (WSNs) provides unprecedented opportunities for monitoring mobile entities. The motivation for this thesis is drawn from real-world applications including monitoring wildlife, assisted living, and logistics. Nevertheless, mobility unveils a series of problems that do not arise in fixed scenarios. Through applications, we distill three of those, as follows.
Neighbor discovery, or knowing the identity of surrounding nodes, is the precondition for any communication between nodes. As compared to other existing solutions, we provide a framework that approaches the problem from the perspectives of latency (the time required to detect an amount of contacts), lifetime (the time nodes are expected to last) and probability (the fraction of contacts guaranteed to be detected within a given latency). By formalizing neighbor discovery as an optimization problem, we obtain a significant improvement w.r.t. the state-of-art. We offer a solver providing the optimal configuration and an implementation for popular WSN devices.
Group membership, or knowing the identity of the transitively connected nodes, can be either the direct answer to a requirement (e.g., caring for people that are not self-sufficient), or a building-block for higher-level abstractions. Earlier works on the same problem target either less constrained devices such as PDAs or laptops or, when targeting WSN devices, provide only post-deployment information on the group. Instead, we provide three protocols that cover the solution space. All our protocols empower each node with a
run-time global view of the group composition.
Finally, we focus on the behavior of the processes monitored by WSNs. We present a system that validates whether global invariants describing the safe behavior of a monitored system are satisfied. Although similar problems have been tackled before, the invariants we target are more complex and our system evaluates them in the network, at run-time. We focus on invariants that are expressed as first-order logic formulas over the state of multiple nodes. The requirement for monitoring invariants arises in both fixed and mobile
environments; we design and implement an efficient solution for each. Noteworthy is that the solution targeting mobility bestows each node with an eventually consistent view on the satisfaction of the monitored invariants; in this context, the group membership algorithms play the role of global failure detectors.
16
Rivard, Frédéric. "Localisation relative de robots mobiles opérant en groupe." Mémoire, Université de Sherbrooke, 2005. http://savoirs.usherbrooke.ca/handle/11143/1294.
Full textAbstract:
Il y a plusieurs avantages à faire travailler des robots mobiles en groupe. Par exemple, un groupe de robots peut diviser une tâche en plusieurs sous-tâches à être effectuées individuellement par des membres du groupe. Lorsque les membres sont capables de se localiser les uns les autres, l'efficacité du groupe en est grandement augmentée. À cette fin, l'objectif du projet est de poursuivre le développement d'un système ultrasonique de localisation relative, système dénommé LAMP. Un premier prototype (LAMP-1) a été développé en 2002, mais sa fonctionnalité avec un groupe de robots n'avait pas été validée. De plus, certains problèmes d'interférence avec le système de détection d'obstacles des robots avaient été observés. Des modifications ont été apportées au système afin d'éliminer ces problèmes tout en conservant les capacités du système. La fréquence d'opération est passée de 40 kHz à 25.7 kHz et un filtre passe-bande a été ajouté afin d'éliminer les fausses détections. Une étude de différents paramètres concernant les réflecteurs utilisés pour rendre le système omnidirectionnel a aussi été effectuée. Le nouveau système (LAMP-2) affiche maintenant une portée de 6,7 m avec une erreur absolue moyenne de 8.03 mm sur la distance et de 3.07À sur l'angle. Sa période d'opération est de 300 ms pour un groupe de quatre robots. Le système LAMP-2 consomme 1.73 W et coûte environ 350 $ à fabriquer. Le système LAMP-2 a été utilisé avec succès pour contrôler des formations de quatre robots et améliore substantiellement les performances du groupe par rapport à celles obtenues lorsque la localisation des robots se fait par détection visuelle de couleur. LAMP-2 a aussi démontré qu'il peut être utilisé dans une combinaison humain-robot en équipant un humain d'un émetteur et en le faisant suivre par trois robots. Le système LAMP-2 peut être transformé en un système de positionnement absolu en plaçant un émetteur fixe dans l'environnement. Les possibilités d'utilisation très variées rendent donc le système LAMP-2 très intéressant pour différentes applications en robotique mobile.
17
Rivard, Frédéric. "Localisation relative de robots mobiles opérant en groupe." [S.l. : s.n.], 2005.
Find full text
18
Lundh, Robert. "Plan-Based Configuration of a Group of Robots." Licentiate thesis, Örebro University, School of Science and Technology, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:oru:diva-2706.
Full textAbstract:
Imagine the following situation. You give your favorite robot, named Pippi, the task to fetch a parcel that just arrived at your front door. While pushing the parcel back to you, she must travel through a door opening. Unfortunately, the parcel she is pushing is blocking her camera, giving her a hard time to see the door to cross. If she cannot see the door, she cannot safely push the parcel through the door opening. What would you as a human do in a similar situation? Most probably you would ask someone for help, someone to guide you through the door, as we ask for help then we need to park our car in a tight parking spot. Why not let the robots do the same? Why not let robots help each other. Luckily for Pippi, there is another robot, named Emil, vacuum cleaning the floor in the same room. Since Emil can view both Pippi and the door at the same time, he can guide pippi through the door, enabling her to deliver the parcel to you.
This work is about societies of autonomous robots in which robots can help each other by offering information-producing functionalities. A functional configuration is a way to allocate and connect functionalities among robots. In general, different configurations can be used to solve the same task, depending on the current situation. For the work on configurations, we have three steps. The first step is to formally define the idea of functional configuration. Second, to show how configurations can be automatically generated and executed. The third step is to address the problem of when and how to change a configuration in response to changing conditions. In this licenciate thesis we report initial work that focus on the two first steps: the third step is subject of future work. We propose a formal definition of functional configurations, and we propose an approach based on artificial intelligence (AI) planning techniques to automatically generate a preferred configuration for a given task, environment, and set of resources. To illustrate these ideas, we describe an experimental system where these are implemented, and show two example of it in which two robots mutually help each other to address tasks. In the first example they help each other to cross a door, and in the second example they carry a bar together.
19
Lam, L. "Student adoption of Facebook private groups for mobile learning in Hong Kong." Thesis, London South Bank University, 2018. http://researchopen.lsbu.ac.uk/2738/.
Full textAbstract:
Mobile learning using Facebook is increasingly used by faculty in universities to improve student engagement. This study examines the determinants influencing students' acceptance of Facebook for mobile learning. Seven determinants were identified in past literature, including: performance expectancy, effort expectancy, device usability, hedonic motivation, habit, social presence and interactive learning. A research model was developed in order to explain students' behavioral intention to use Facebook private study groups for mobile learning. The model was empirically tested using the survey data collected from students (N=123) of a marketing course taught using mobile learning in a classroom setting. It was followed by focus group interviews for triangulation and further exploration based on student feedback and comments. Research findings confirmed that all seven determinants had significant positive associations with the behavioral intention to use Facebook private study groups for mobile learning. Hedonic motivation had the most significant positive association with the students' behavioral intention. In addition, it was found that social norms played an important role in influencing student use behavior. The findings of this research provide insights into (1) the theory and practice in the successful implementation of mobile learning using Facebook, (2) blended pedagogical strategies in confronting the continuous technology innovation and changing learning preferences of a new generation of students and (3) management strategies in mobile learning.
20
LIM, Léon. "Gestion de groupe partitionnable dans les réseaux mobiles spontanés." Phd thesis, Institut National des Télécommunications, 2012. http://tel.archives-ouvertes.fr/tel-00789709.
Full textAbstract:
Dans les réseaux mobiles spontanés (en anglais, Mobile Ad hoc NETworks ou MANETs), la gestion de groupe partitionnable est un service de base permettant la construction d'applications réparties tolérantes au partitionnement. Aucune des spécifications existantes ne satisfait les deux exigences antagonistes suivantes : 1) elle doit être assez forte pour fournir des garanties utiles aux applications réparties dans les systèmes partitionnables ; 2) elle doit être assez faible pour être résoluble. Dans cette thèse, nous proposons une solution à la gestion de groupe partitionnable en environnements réseaux très dynamiques tels que les MANETs. Pour mettre en œuvre notre solution, nous procédons en trois étapes. Tout d'abord, nous proposons un modèle de système réparti dynamique qui caractérise la stabilité dans les MANETs. Ensuite, nous adaptons pour les systèmes partitionnables l'approche Paxos à base de consensus Synod. Cette adaptation résulte en la spécification d'un consensus abandonnable AC construit au-dessus d'un détecteur ultime des α participants d'une partition ♢PPD et d'un registre ultime par partition ♢RPP. ♢PPD garantit la vivacité dans une partition même si la partition n'est pas complètement stable tandis que ♢RPP préserve la sûreté dans la même partition. Enfin, la gestion de groupe partitionnable est résolue en la transformant en une séquence d'instances de AC. Chacun des modules ♢PPD, ♢RPP, AC et gestion de groupe partitionnable est implanté et prouvé. Par ailleurs, nous analysons les performances de ♢PPD par simulation
21
El, Kamel Mohamed Anouar. "Stabilisation et régulation de robots mobiles opérant en groupe." Phd thesis, Université d'Evry-Val d'Essonne, 2012. http://tel.archives-ouvertes.fr/tel-00876452.
Full textAbstract:
Pour les systèmes de commande sous la forme de dx/dt = f (x, u), dans la littérature, les chercheurs s'intéressaient à la stabilisation de ce système de différentes manières : asymptotique, uniformément asymptotique, partielle, en temps fini, etc. Pour aboutir à ces résultats, les méthodes utilisées font appel aux techniques suivantes : Lyapunov, Lasalle, Barbalat, surface glissante, etc. Dans cette thèse, nous nous sommes intéressés à une autre fonctionnalité de la commande, dite commande répulsive stabilisante. Les résultats ont été généralisés au cas d'un système avec dérive et sans dérive. Comme résultat, l'approche de commande qu'on propose assure la stabilité du système autour d'une position désirée et la répulsion de celui-ci par rapport à un ensemble indésirable, construit dans l'espace de navigation. Toute forme d'application sera concernée par nos résultats théoriques, on peut citer, la navigation terrestre et aérienne dans un environnement peu ou pas connu. De même, la commande qu'on propose préserve la communication inter-agent, une fois planifiées. En terme d'application, on a considéré le modèle d'un véhicule à roues type unicycle, sans tenir compte de l'orientation (cas non holonôme) et dans le cas où l'environnement contient un ou plusieurs obstacle(s). Contrairement aux résultats de la littérature, qui sont basés sur une commande à structure variable pour l'évitement d'un obstacle, la commande répulsive-stabilisante trouvée est une commande continue sur l'espace de navigation. La deuxième partie de cette thèse traite le problème de stabilité d'une formation d'agents (système multi-véhicules) qui évolue dans un environnement hostile tout en préservant la communication entre les agents. Pour réussir la formation, la décentralisation de la commande par rapport aux agents est rendue robuste à travers des graphes de communication. Ces graphes relèvent de la stratégie et objectifs de la formation. Nos résultats de stabilité ont fait l'objet d'une implémentation rigoureuse sur un simulateur réalisé sous Matlab.
22
Lim, Léon. "Gestion de groupe partitionnable dans les réseaux mobiles spontanés." Thesis, Evry, Institut national des télécommunications, 2012. http://www.theses.fr/2012TELE0032/document.
Full textAbstract:
Dans les réseaux mobiles spontanés (en anglais, Mobile Ad hoc NETworks ou MANETs), la gestion de groupe partitionnable est un service de base permettant la construction d'applications réparties tolérantes au partitionnement. Aucune des spécifications existantes ne satisfait les deux exigences antagonistes suivantes : 1) elle doit être assez forte pour fournir des garanties utiles aux applications réparties dans les systèmes partitionnables ; 2) elle doit être assez faible pour être résoluble. Dans cette thèse, nous proposons une solution à la gestion de groupe partitionnable en environnements réseaux très dynamiques tels que les MANETs. Pour mettre en œuvre notre solution, nous procédons en trois étapes. Tout d'abord, nous proposons un modèle de système réparti dynamique qui caractérise la stabilité dans les MANETs. Ensuite, nous adaptons pour les systèmes partitionnables l'approche Paxos à base de consensus Synod. Cette adaptation résulte en la spécification d'un consensus abandonnable AC construit au-dessus d'un détecteur ultime des α participants d'une partition ♢PPD et d'un registre ultime par partition ♢RPP. ♢PPD garantit la vivacité dans une partition même si la partition n'est pas complètement stable tandis que ♢RPP préserve la sûreté dans la même partition. Enfin, la gestion de groupe partitionnable est résolue en la transformant en une séquence d'instances de AC. Chacun des modules ♢PPD, ♢RPP, AC et gestion de groupe partitionnable est implanté et prouvé. Par ailleurs, nous analysons les performances de ♢PPD par simulationIn Mobile Ad hoc NETworks or MANETs, partitionable group membership is a basic service for building partition-tolerant applications. None of the existing specifications satisfy the two following antagonistic requirements: 1) it must be strong enough to simplify the design of partition-tolerant distributed applications in partitionable systems; 2) it must be weak enough to be implantable. In this thesis, we propose a solution to partitionable group membership in very dynamic network environment such as MANETs. To this means, we proceed in three steps. First, we develop a dynamic distributed system model that characterises stability in MANETs. Then, we propose a solution to the problem of partitionable group membership by adapting Paxos for such systems. This adatation results in a specification of abortable consensus AC which is composed of an eventual α partition-participants detector ♢PPD and an eventual register per partition ♢RPP. ♢PPD guarantees liveness in a partition even if the partition is not completely stable whereas ♢RPP ensures safety in the same partition. Finally, partitionable group membership is solved by transforming it into a sequence of abortable consensus instances AC. Each of the modules ♢PPD, ♢RPP, AC, and partitionable group membership is implanted and proved. Next, we analyse the performances of ♢PPD by simulation
23
Lal, Mayank. "Motion planning algorithms for a group of mobile agents." Texas A&M University, 2008. http://hdl.handle.net/1969.1/86038.
Full textAbstract:
Building autonomous mobile agents has been a major research effort for a while
with cooperative mobile robotics receiving a lot of attention in recent times. Motion
planning is a critical problem in deploying autonomous agents. In this research we
have developed two novel global motion planning schemes for a group of mobile agents
which eliminate some of the disadvantages of the current methods available. The first
is the homotopy method in which the planning is done in polynomial space. In this
method the position in local frame of each mobile agent is mapped to a complex
number and a time varying polynomial contains information regarding the current
positions of all mobile agents, the degree of the polynomial being the number of
mobile agents and the roots of the polynomial representing the position in local
frame of the mobile agents at a given time. This polynomial is constructed by finding
a path parameterized in time from the initial to the goal polynomial (represent the
initial and goal positions in local frame of the mobile agents) so that the discriminant
variety or the set of polynomials with multiple roots is avoided in polynomial space.
This is equivalent to saying that there is no collision between any two agents in going
from initial position to goal position. The second is the homogeneous deformation
method. It is based on continuum theory for motion of deformable bodies. In this
method a swarm of vehicles is considered at rest in an initial configuration with no
restrictions on the initial shape or the locations of the vehicles within that shape. A
motion plan is developed to move this swarm of vehicles from the initial configuration to a new configuration such that there are no collisions between any vehicles at
any time instant. It is achieved via a linear map between the initial and desired
final configuration such that the map is invertible at all times. Both the methods
proposed are computationally attractive. Also they facilitate motion coordination
between groups of mobile agents with limited or no sensing and communication.
24
Oçafrain, William. "Quasi-stationnarité avec frontières mobiles." Thesis, Toulouse 3, 2019. http://www.theses.fr/2019TOU30050.
Full textAbstract:
Cette thèse étudie les comportements asymptotiques de processus de Markov conditionnés à ne pas atteindre de frontières mobiles. Le premier chapitre s'intéresse à cette question pour des chaînes de Markov à temps discret définies sur un espace d'état finie en considérant des frontières périodiques. Si les notions de distributions quasi-stationnaires et de distributions quasi-limites sont mal définies dans ce cas, l'existence de distribution quasi-ergodiques et d'un Q-processus est démontré. Dans le deuxième chapitre, les résultats précédents sont étendues à des processus de Markov satisfaisant des conditions inhomogènes globales introduites par N.Champagnat et D.Villemonais. Dans le cas de frontières périodiques, nous obtenons l'existence et l'unicité d'une distribution quasi-ergodique. Dans le cas où la frontière absorbante se stabilise à l'infini, nous obtenons en plus l'existence et l'unicité d'une distribution quasi-limite. Le troisième chapitre s'intéresse à la quasi-stationnarité du mouvement brownien dit "renormalisé" absorbé en {-1,1}. Ce processus dépend d'un paramètre K et sa quasi-stationnarité présente une transition de phase de paramètre critique égal à 1/2. Enfin, le dernier chapitre étend les résultat du deuxième à des processus satisfaisant des critères plus faible que les conditions globales de Champagnat-Villemonais. On y démontre notamment une propriété de mélange, l'existence du Q-processus et d'une distribution quasi-ergodique pour certains comportement de frontières mobilesThis thesis studies the asymptotic behaviors for Markov processes conditioned not to hit moving boundaries. The first chapter deals with this problem for discrete-time Markov chains defined on finite state space considering periodic boundaries. Even if the notions of quasi-stationary distributions and quasi-limiting distributions are not well-defined considering moving boundaries, the existence of a quasi-ergodic distribution and the Q-process are shown. In the second chapter, the previous results are extended to Markov processes satisfying some global inhomogeneous conditions introduced by N. Champagnat and D. Villemonais. In the periodic case, the existence and uniqueness of a quasi-ergodic distribution are proved. When the boundary stabilizes at infinity, we obtain moreover the existence and uniqueness of a quasi-limiting distribution. The third chapter deals with the quasi-stationarity for the "renormalized" Brownian motion absorbed at {-1,1}. The law of this process depends on a parameter K and a phase transition is observed for its quasi-stationarity, whose the critical parameter is equal to 1/2. Finally, the last chapter extend the results obtained in the second chapter to Markov processes satisfying some criteria weaker than the global Champagnat-Villemonais conditions. In particular, we obtain under these conditions a mixing property, the existence of the Q-process and the existence of a quasi-ergodic distribution for some behaviors of the boundary
25
Adouane, Lounis. "Architectures de contrôle comportementales et réactives pour la coopération d'un groupe de robots mobiles." Phd thesis, Université de Franche-Comté, 2005. http://tel.archives-ouvertes.fr/tel-00128160.
Full textAbstract:
Contrôler un système multi-robots hautement dynamique au sein duquel évolue un grand nombre d'entités autonomes réactives est un challenge à la fois scientifique et technologique en plein essor. En effet, ceci exige non seulement d'utiliser des entités robotiques les plus élémentaires possibles mais nécessite également au niveau du contrôle, de s'éloigner davantage des conceptions centralisées et cognitives. La démarche consiste à focaliser la conception du contrôle sur l'individu élémentaire constituant le système multi-robots en prenant en compte les différentes interactions locales de cet individu avec les autres entités robotiques avec lesquels il est censé coopérer. Des effets de masse maîtrisés peuvent être ainsi obtenus et vont permettre d'augmenter à la fois la vitesse, la flexibilité et la robustesse d'exécution des tâches complexes entreprises. Les travaux de recherche présentés dans ce mémoire partent du principe d'une conception ascendante (Bottom-Up) des architectures de contrôle et ce afin de briser la complexité inhérente aux systèmes multi-robots. Plus spécifiquement, nous proposons un Processus de Sélection d'Action Hiérarchique appelé PSAH qui permet à l'échelle du robot de coordonner l'activité d'un ensemble de primitives élémentaires (comportements) d'une manière hiérarchique et flexible, et à l'échelle du groupe de robots d'atteindre une coordination entre robots favorisant des buts globaux. Les performances du PSAH ont été améliorées par la suite via l'adjonction d'un mécanisme de fusion d'actions approprié conduisant à un nouveau processus de sélection appelé PSAHH (PSAH-Hybride). Les formalismes des algorithmes génétiques ont été utilisés par la suite pour proposer une méthodologie permettant l'obtention des paramètres prépondérants pour le fonctionnement du PSAHH. La validation des résultats s'est effectuée au travers d'expérimentations sur des mini-robots ALICE et plus largement sur un ensemble d'études statistiques réalisées sur un grand nombre de données obtenu grâce au simulateur MiRoCo (Mini-Robotique Collective). Ce simulateur a été conçu et développé dans le cadre de nos travaux de thèse dans le but de simuler d'une manière précise et rigoureuse des systèmes multi-robots à forte dynamique d'interaction.
26
Kitson, Michael E. "The Sex Pistols and the London mob." View thesis, 2008. http://handle.uws.edu.au:8081/1959.7/38784.
Full textAbstract:
Thesis (Ph.D.) -- University of Western Sydney, 2008.A thesis presented to the University of Western Sydney, College of Arts, School of Communication Arts, in fulfilment of the requirements for the degree of Doctor of Philosophy. Includes bibliography.
27
Mayende, Godfrey. "Mobile Technologies to Support Discussion Groups within in Distance Education in Developing Countries." Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2007. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-8820.
Full textAbstract:
During the autumn project we explored how mobile technologies could be used to improve collaboration in distance education in developing countries. During this study we identified the importance of discussion groups. In this thesis continuing from the autumn project I traveled to Uganda and administered interview on the BED students in order to understand better how discussion groups are formed and managed, hence understanding better the activities technology can support. In this study we used different methods of data collection. Since we had already done a study in the previous semester we used some the information we hd gathered before to inform us about some aspect. We also used a questionnaire as earlier mentioned and observation since we were in Uganda during a face-to-face session. We presented the results which informed us and we characterised the discussion groups in two that is assignment discussion group and general discussion group giving the characteristics of each in detail. In the results presentation we grouped the chapter into major sub section that need support. We then anaylsed the data collected were we present it in form of scenarios without technology support. In this chapter we have different possibility when Markus whats to create group, join group, leave a group, etc. In here we identify some activities that need support e.g. group management, coordination, communication and collaboration. We then presented the services in the design chapter in use cases and described the different use cases. These use cases helped us to know the detail functionalities that we need to support. There after we developed demonstration prototype to demonstrate some of the functionalities of the design. Though we would have liked to have every thing on our demonstration prototype we just did a few services to demonstrate what we needed. We then evaluated our demonstrator aganist the scenarios we had earlier in the analysis by trying to see how the demonstrator solve some of the problems Markus encounted.
28
Momen, Sifat. "Design and modelling of decentralised task allocation mechanisms in groups of mobile agents." Thesis, University of Sheffield, 2011. http://etheses.whiterose.ac.uk/1719/.
Full textAbstract:
Division of labour is a fundamental field of research within the context of multi-agent (particularly swarm based systems) and multi-robot systems. Eusocial insects, for instance ants and bees, are known to display remarkable capabilities of allocating tasks to nest mates when the colony gets perturbed by any internal and/or external factors. Proper understanding of the underlying mechanisms of division of labour among these social insects would enable more effective designing and developing of artificial swarm based systems which in turn can be used in tackling various real world problems. At the same time, a properly built model can be used to serve as a platform for the biologists to test their research hypotheses. These key benefits have been the prime motivations of this thesis. The thesis is based on the behaviour of ant colonies and especially on how they allocate tasks in different situations. The objectives of the thesis are twofold: (1) to develop an artificial simulated system that is ant-like and (2) to explore, identify, develop and analyse task allocation strategies within the realms of colony performance. The first objective of the thesis is approached by investigating the behaviour of ant colonies from the existing literature and modelling their behaviours using an agent based modelling approach. To determine whether the model has met the first objective, three questions are posed: (A) Is the emergent system scalable? (B) Is the emergent system flexible? and (C) Is the system robust? For a system to be ant-like, the system has to not only give the appearance of ant-like behaviour but also has to meet these three criteria. As a part of the second objective of the thesis, three task allocation strategies based on ant colony behaviour are proposed. Furthermore, the strategies are critically analysed to investigate the benefits of each of the strategies and also to discover under what circumstances which strategies would perform better. The research reported in this thesis is intended to provide a better understanding of the design issues of task allocation strategies thus enabling researchers to use this as a guide to design effective task allocation strategies within the concerned multi-agent systems.
29
Atallah, Eve. "Une solution pour l'établissement non planifié de groupes sécurisés permettant des communications sûres dans les réseaux MANets purs." Limoges, 2008. https://aurore.unilim.fr/theses/nxfile/default/dc02beb3-c3d0-4717-8d6f-6a3706b2da76/blobholder:0/2008LIMO4060.pdf.
Full textAbstract:
Le travail présenté dans cette thèse porte sur les réseaux MANets sans centralisation ni administration dans lesquels les utilisateurs sont mobiles et non nécessairement liés entre eux par une organisation humaine. Notre contribution consiste en une architecture totalement décentralisée permettant de sécuriser les échanges au sein de tels réseaux. Sa concrétisation, l'application SManet, repose sur un module administrateur embarqué sur carte à puce chargé de tâches habituellement réalisées par une entité centralisée. Chaque dispositif utilisateur possède une carte équipée de ce module qui procède à toutes les opérations de contrôle assurant le bon comportement de son hôte et la sécurité des communications avec les autres possesseurs d'une carte. Cette solution permet de mettre en place des échanges sûrs, n'importe où, n'importe quand, sans aucune planification et donc sans aucune oraganisation humaine préalable sous-jacenteThe work presented in this thesis is about MANets with no centralization or administration and where users are highly mobile and not necessarily linked together within a human organization. Our contribution is a decentralized architecture that makes it possible to secure communication within such networks. Its implementation, the SManet application, is based on an administrator module embedded in a mart card which is in charge of the tasks usually carried out by a centralized entity. Each mobile treminal is equipped with a card embedding such a module that controls the operations ensuring the correct behavior of its host and the security of the communications with the other card holders. This solution supports the establishment of secure exchanges, anywhere, anytime, with no planning and thus without any prior underlying human organization
30
Souères, Philippe. "Commande optimale et robots mobiles non holonomes." Toulouse 3, 1993. http://www.theses.fr/1993TOU30221.
Full textAbstract:
Le travail présenté dans ce mémoire s'inscrit dans le cadre de la planification de trajectoires pour robots mobiles non holonomes. Il concerne la recherche de trajectoires optimales. Le principal modèle étudie est un robot de type voiture, astreint à se déplacer tangentiellement à son axe principal sur des trajectoires dont la courbure est bornée. L'auteur montre comment caractériser complètement un plus court chemin entre deux configurations quelconques. Ce travail s'appuie sur des résultats d'autres auteurs déterminant une famille réduite de trajectoires, suffisamment riche pour toujours contenir une solution. L'auteur utilise ce résultat en couplant une méthode géométrique avec les conditions nécessaires du principe du maximum de Pontriaguine (pmp). Le problème est ainsi complétement résolu par la donnée d'une synthèse des plus courts chemins dans l'espace des configurations. Ce résultat constitue un remarquable exemple de synthèse régulière pour un système non linéaire dans un espace a trois dimensions. La forme exacte des boules associées a la métrique induite par les plus courts chemins est ensuite calculée, cela constitue un outil essentiel pour la planification et l'évaluation de la complexité algorithmique. Par un calcul des courbes d'isodistance dans l'espace des configurations l'auteur met en évidence l'existence de plusieurs fronts d'onde expliquant les limites de précision des informations données par la pmp. L'ensemble d'accessibilité de la voiture est ensuite obtenu par la résolution du problème à orientation finale libre. La méthode est alors réutilisée pour construire une synthèse des plus courts chemins pour le modèle d'une voiture évoluant uniquement en marche avant. Le dernier modèle étudié possède un système de locomotion constitue de deux roues indépendantes commandées en accélération. Dans ce cas, à partir d'une analyse des extrémales données par le pmp pour le problème en temps minimal, l'auteur présente une méthode pour le lissage de lignes brisées
31
Cheverst, Keith William John. "Development of a group service to support collaborative mobile groupware." Thesis, Lancaster University, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.310505.
Full text
32
Shah, Syed Waqar. "Group based coordination in a multiple mobile agent system (MMAS)." Thesis, University of Strathclyde, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.423866.
Full text
33
Denson, D. Paul. "Modeling and performance analysis for mobile group localization and formation." Laramie, Wyo. : University of Wyoming, 2008. http://proquest.umi.com/pqdweb?did=1594486491&sid=1&Fmt=2&clientId=18949&RQT=309&VName=PQD.
Full text
34
Barjon, Matthieu. "Autour des groupes tolérants aux délais dans les flottes mobiles communicantes." Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0298/document.
Full textAbstract:
Parmi les évolutions majeures de l'informatique, nous distinguons l'émergence des technologies mobiles sans fil. Le développement actuel de ces technologies permet de réaliser des communications ad-hoc directes entre de nombreux types d'entités mobiles, comme des véhicules, des robots terrestres ou des drones. Dans un réseau de tels équipements, l'ensemble des liens de communication qui existe à un instant donné dépend des distances entre les entités et la topologie du réseau change continuellement lorsque les entités se déplacent. Les hypothèses habituelles sur la connexité du réseau n'ont pas leur place ici, néanmoins, une autre forme de connexité appelée connexité temporelle est souvent disponible à travers le temps et l'espace. L'objectif de cette thèse a été de développer des algorithmes pour les flottes d'appareils dans le cas des réseaux tolérant aux délais (DTN). De manière simplifiée, les réseaux tolérants aux délais sont des réseaux pour lesquels certaines parties peuvent se retrouver isolées pendant un moment sans que cela pose problème. Nous nous intéressons, en particulier, au cas où ces appareils sont organisés sous la forme de groupes, et où la notion de groupe elle même survit à ces déconnexions transitoires. Ainsi, une grande partie de la thèse s'articule autour de la notion des groupes tolérant aux délais (groupe DTN). Dans notre cas cet éloignement est limité dans le temps et nous parlons alors de "diamètre temporel borné" au sein du groupe. Le fait de borner le diamètre temporel du groupe lui permet de distinguer entre l'éloignement temporaire d'un noeud et sa perte définitive (crash ou autre)Among the major developments in computer science, we distinguish the emergence of mobile wireless technologies. The current development of these technologies allows for direct ad-hoc communications between many types of mobile entities, such as vehicles, land robots or drones. In a network of such devices, the set of communication links that exists at a given instant depends upon the distances between the entities. As a result, the topology of the network changes continuously as the entities move. The common assumption on connectivity may not be relevant in this case, but another kind of connectivity called temporal connectivity is often alvailable over time and space. The goal of this thesis has been the development of algorithms for fleets of mobile devices in the case of delay-tolerant networks. In a simpler way, the delay-tolerant networks are networks where some parts can be isolated during a certain time without problems. We are interested, in particular, in the case where the devices are organised as groups, and where the notion of group itself survives to these deconnections. Hence, a big part of this thesis relates to the notion of delay-tolerant groups (DTN groups). In our case, these deconnections are limited in time and we speak of a "bounded temporal diameter" within the group. The fact of limiting the temporal diameter of the group enables it to distinguish between temporary deconnections and final loss (crash or other) of some nodes
35
Kalogridis, Georgios. "Preemptive mobile code protection using spy agents." Thesis, Royal Holloway, University of London, 2011. http://repository.royalholloway.ac.uk/items/1863e436-1c99-0cae-8a59-c6bee0c9553e/9/.
Full textAbstract:
This thesis introduces 'spy agents' as a new security paradigm for evaluating trust in remote hosts in mobile code scenarios. In this security paradigm, a spy agent, i.e. a mobile agent which circulates amongst a number of remote hosts, can employ a variety of techniques in order to both appear 'normal' and suggest to a malicious host that it can 'misuse' the agent's data or code without being held accountable. A framework for the operation and deployment of such spy agents is described. Subsequently, a number of aspects of the operation of such agents within this framework are analysed in greater detail. The set of spy agent routes needs to be constructed in a manner that enables hosts to be identified from a set of detectable agent-specific outcomes. The construction of route sets that both reduce the probability of spy agent detection and support identification of the origin of a malicious act is analysed in the context of combinatorial group testing theory. Solutions to the route set design problem are proposed. A number of spy agent application scenarios are introduced and analysed, including: a) the implementation of a mobile code email honeypot system for identifying email privacy infringers, b) the design of sets of agent routes that enable malicious host detection even when hosts collude, and c) the evaluation of the credibility of host classification results in the presence of inconsistent host behaviour. Spy agents can be used in a wide range of applications, and it appears that each application creates challenging new research problems, notably in the design of appropriate agent route sets.
36
Mercer, James W. "Eagle forums the development of accountability groups among the pastors of the Mobile Baptist Association /." Online full text .pdf document, available to Fuller patrons only, 2002. http://www.tren.com.
Full text
37
Le, Minh. "Universal Mobile Service Execution Framework for Device-To-Device Collaborations." DigitalCommons@USU, 2018. https://digitalcommons.usu.edu/etd/7032.
Full textAbstract:
There are high demands of effective and high-performance of collaborations between mobile devices in the places where traditional Internet connections are unavailable, unreliable, or significantly overburdened, such as on a battlefield, disaster zones, isolated rural areas, or crowded public venues. To enable collaboration among the devices in opportunistic networks, code offloading and Remote Method Invocation are the two major mechanisms to ensure code portions of applications are successfully transmitted to and executed on the remote platforms. Although these domains are highly enjoyed in research for a decade, the limitations of multi-device connectivity, system error handling or cross platform compatibility prohibit these technologies from being broadly applied in the mobile industry.
To address the above problems, we designed and developed UMSEF - an Universal Mobile Service Execution Framework, which is an innovative and radical approach for mobile computing in opportunistic networks. Our solution is built as a component-based mobile middleware architecture that is flexible and adaptive with multiple network topologies, tolerant for network errors and compatible for multiple platforms. We provided an effective algorithm to estimate the resource availability of a device for higher performance and energy consumption and a novel platform for mobile remote method invocation based on declarative annotations over multi-group device networks. The experiments in reality exposes our approach not only achieve the better performance and energy consumption, but can be extended to large-scaled ubiquitous or IoT systems.
38
Stone, Christopher E., Keith D. Flint, and Gregory P. Mathis. "THE PHILLIPS LABORATORY’S MOBILE GROUND TRACKING STATION (MGTS)." International Foundation for Telemetering, 1995. http://hdl.handle.net/10150/608411.
Full textAbstract:
International Telemetering Conference Proceedings / October 30-November 02, 1995 / Riviera Hotel, Las Vegas, NevadaPhillips Laboratory's Space Experiments Directorate (PL/SX) is operating and upgrading the laboratory's premier transportable satellite tracking station, the Mobile Ground Tracking Station (MGTS) program. MGTS supports orbital, suborbital, and aircraft missions as a range system capable of processing and recording multiple data streams. MGTS receives, processes, displays, and records satellite state-of-health data, infrared images in a variety of wavelengths, video data, and state vector solutions based on IR returns from the Miniature Sensor Technology Integration (MSTI) satellite program. The program has began in 1990 under BMDO sponsorship, with the intent to supplement existing test ranges with more flexibility in range operations. Wyle Laboratories and Systems Engineering and Management Company (SEMCO) provided the technical expertise necessary to create the first MGTS system. Autonomy and off-road capability were critical design factors, since some of the operations envisioned require deployment to remote or hostile field locations. Since inception, MGTS has supported the Lightweight Exo-Atmospheric Projectile (LEAP) sub-orbital missions, the MSTI satellite program, and Air Force wargame demonstrations. In pursuit of these missions, MGTS has deployed to White Sands Missile Range (WSMR), NM; Air Force Flight Test Center (AFFTC), Edwards AFB, CA; Vandenberg AFB, CA; Falcon AFB, CO; and NASA's Wallops Island Flight Facility, VA, to receive critical mission telemetry data conforming to both IRIG and SGLS standards. This paper will describe the evolution of the MGTS program, current hardware configurations and past and future mission scenarios for the MGTS team.
39
Chan, Yew Meng. "Processing mobile read-only transactions in broadcast environments with group consistency /." access full-text access abstract and table of contents, 2005. http://libweb.cityu.edu.hk/cgi-bin/ezdb/thesis.pl?mphil-cs-b19887504a.pdf.
Full textAbstract:
Thesis (M.Phil.)--City University of Hong Kong, 2005."Submitted to Department of Computer Science in partial fulfillment of the requirements for the degree of Master of Philosophy" Includes bibliographical references (leaves 98-102)
40
Mofokeng, Dalene. "HIV patients’ perceptions of mobile technology support in Nelson Mandela Bay, Eastern Cape." University of Western Cape, 2021. http://hdl.handle.net/11394/8050.
Full textAbstract:
Magister Commercii (Information Management) - MCom(IM)South Africa has one of the largest HIV and AIDS burdens in the world, with an estimated7.52 million people living with HIV in 2018. The antiretroviral therapy (ART) programme is the biggest and most costly programme in the country, with 3.7 million people enrolled as of 2017. The success of antiretroviral therapy is dependent on adherence to medication and long-term retention in care. It has been reported that support groups can improve the treatment adherence of patients and their retention in care. However, enrolment in adherence support groups is voluntary, and the abovementioned success thereof is dependent on the commitment of the patient to active participation in the group. It is estimated that about 80% of adults and young people own at least one mobile phone, which makes this technology suitable to improve communication and enhance interaction amongst support group members.
41
Pradhan, Pushkar P. "Efficient group membership algorithm for ad hoc networks." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE0000593.
Full text
42
Liu, Shuai. "Mobile Devices for Facilitating Group Fitness and Visualization of Fitness Data." Thesis, Virginia Tech, 2020. http://hdl.handle.net/10919/98622.
Full textAbstract:
Lack of physical activity is a major problem contributing to diseases and poor health. Nowadays, mobile fitness apps serve in important roles in encouraging and facilitating people to do more physical exercise. Many apps focus primarily on individual behavioral strategies, such as displaying individual steps to encourage physical activity. Such strategies help evoke one's internal motivation such as peer recognition and competition achievement. However, such apps usually de-emphasize or ignore interpersonal behavioral strategies, such as team rank. And group-based strategies are very important in aspects such as peer recognition and can facilitate more physical activity. This research explores the design strategies of group-based dynamic approaches for encouraging physical activity in small-size groups. The development effort takes into account the different roles of mobile devices and laptops and the evaluation explored the effectiveness of the design.Master of Science
Lack of physical activity is a major problem contributing to diseases and poor health. Nowadays, mobile fitness apps like Fitbit and Runkeeper help encourage people to exercise. Many apps focus primarily on things like steps for each person. However, this research shifts the focus to small team goals and motivations, such as team rank and team progress toward an overall goal. This research explores ways to get people motivated through showing them information on their mobile phone or a web site. Several different visual displays were created and evaluated.
43
David, Cailean. "Community, Crowdsourcing, and Commerce: WhatsApp Groups for Agriculture in Kenya." Thesis, Université d'Ottawa / University of Ottawa, 2020. http://hdl.handle.net/10393/41530.
Full textAbstract:
WhatsApp’s growing presence in the developing world has led to a grassroots movement of messaging groups designed to serve relevant needs for small scale farmers in Kenya. These groups provide the means for as many as 256 members to ask questions, share experiences and solutions, gain access to information, and access markets for their products. This research project examines the use of these WhatsApp groups for agriculture in Kenya. The project seeks to understand the existing barriers to participation, and the use, benefits, and shortcomings of these groups for their members. Research findings indicated that farmers’ overall access to smart phones is a substantial barrier to their participation in groups for agriculture, and these barriers are expectedly more difficult for the poorest and most vulnerable (in which intersectional poverty creates additional barriers). However, while each group can vary significantly, members report that WhatsApp groups as a whole overwhelmingly benefit their livelihoods and practice. Systemic and societal change occurs when the experiences and successes of one individual are shared with a larger group – leading to rapid and shared prosperity. As each individual learns a new skill, technique, or input, the group must also learn and benefit from that knowledge. WhatsApp provides the means and the platform for this type of information exchange to occur at scale, and with individuals who would otherwise be unlikely to communicate. This research project examines the emerging use of grassroots WhatsApp groups as a potential example of this positive and inclusive approach to extension and development in agricultural communities.
44
Robichaud, Étienne. "Maximisation de l'autonomie énergétique d'un groupe de robots mobiles par auto-observation." Mémoire, Université de Sherbrooke, 2006. http://savoirs.usherbrooke.ca/handle/11143/1343.
Full textAbstract:
Le projet a pour objectif premier de développer une méthode permettant à un groupe de robots mobiles de se partager efficacement des ressources énergétiques limitées, dans le but de leur permettre de réaliser des tâches de façon entièrement autonome sur de longues périodes de temps. L'approche privilégiée a été développée de manière à supporter un nombre dynamiquement variable de robots et de stations de recharge. Elle est basée sur l'analyse de la consommation énergétique de chacun des robots du groupe et se déploie selon le modèle d'une architecture distribuée. La méthode présente, entre autres, un algorithme dédié à l'analyse énergétique des robots et deux autres consacrés au partage efficace des stations de recharge. Elle présente aussi des équations permettant de déterminer des paramètres théoriques en rapport avec les conditions d'expérimentation, comme le taux d'activité attendu des robots et la quantité minimale de ressources énergétiques nécessaires pour assurer soit la survie, soit la pleine activité d'un groupe de robots donné. L'approche a été validée par des expériences menées avec des robots mobiles réels, alimentés en énergie par des stations de recharge autonome dans un enclos fermé assez restreint. Il a été possible de maintenir en vie deux robots se partageant une station de recharge, alors que deux stations de recharge ont permis de faire survivre des groupes de trois et de quatre robots durant plusieurs heures. Les résultats ainsi obtenus démontrent que la méthode proposée permet de maximiser l'utilisation des ressources énergétiques disponibles pour favoriser la réalisation d'une tâche. Le recours à des simulations a également permis de déterminer que, pour gérer le partage de stations de recharge dans le contexte où la ressource énergétique est limitée par rapport aux besoins des robots, un algorithme basé sur la planification des périodes de recharge est plus efficace qu'un algorithme ne faisant que réagir lors de situations critiques. Les simulations ont aussi permis de confirmer les capacités de l'algorithme à opérer dans des conditions variées, entre autres avec des systèmes de recharge plus ou moins rapides et des groupes comptant jusqu'à un millier de robots.
45
Jelger, Christophe. "Gestion des équipements mobiles et communications de groupe dans l'internet nouvelle génération." Université Louis Pasteur (Strasbourg) (1971-2008), 2004. http://www.theses.fr/2004STR13099.
Full textAbstract:
Les communications multimédia sont devenues extrêmement populaires dans l'Internet. Des services tels que la télévision et la radio par Internet attirent en effet un nombre croissant d'utilisateurs. La particularité de ces applications est qu'elles font communiquer un groupe d'utilisateurs : elles sont donc adaptées à l'utilisation du routage multicast. Dans le même temps, on assiste à un déploiement très rapide de technologies de communication sans-fil. Or les utilisateurs mobiles veulent profiter des services disponibles à partir des réseaux filaires classiques. En particulier, les réseaux sans-fil doivent être capables de supporter le routage de données multicast. Dans la première partie de cette thèse, nous avons étudié différents aspects des communications de groupe avec des participants mobiles. Nous avons évalué par simulations les effets de cette mobilité sur le routage multicast. Nous avons également proposé un protocole permettant de gérer la mobilité de la source d'un arbre de diffusion multicast. Ce protocole a été évalué par simulations et nous avons montré qu'il surpasse les solutions existantes. Dans la seconde partie de ce mémoire, nous avons étudié le déploiement du routage multicast dans les réseaux ad hoc hybrides. Un réseau ad hoc hybride est un réseau ad hoc dont au moins un nœud possède une connexion vers l'Internet. Notre premier objectif a été de mettre en œuvre un protocole d'autoconfiguration d'adresses dans le cadre du protocole IP version 6. Notre proposition est basée sur le concept innovant de continuité de préfixe dans un réseau ad hoc : notre protocole permet en particulier d'obtenir des sous-réseaux connexes. Nous avons également évalué différents algorithmes permettant de maintenir la continuité de préfixe via des simulations. Dans un deuxième temps, nous avons appliqué le concept de continuité de préfixe aux communications de groupe. Nous avons ainsi proposé un ensemble de règles permettant de construire des structures de diffusion multicast respectant la continuité de préfixe. Cette approche est très intéressante car elle permet d'envisager la mise en place de protocoles de gestion de réseaux, de procédures de contrôle d'accès, et de techniques de transcodage au niveau des passerelles d'un réseau ad hoc hybrideMultimedia communications have become extremely popular in the Internet. Services such that Internet TV and radio are indeed attracting an increasing number of users. The particularity of these applications is that they are based on a group of users and can therefore benefit from the use of multicast communications. In the mean time, wireless networks are being deployed at a very fast pace. Mobile Internet users undoubtedly want to be able to have access to the services that are available in wired networks. In particular, it means that wireless networks must be multicast-capable in order to support group communications. In the first part of this thesis, we have studied different aspects of the combination of mobile users and multicast communications. We have evaluated through extensive simulations the effects of node mobility on multicast communications. We have also proposed a new protocol which aims to support mobile sources in source-rooted multicast trees. This protocol has been evaluated via simulations and it has been shown to outperform other existing solutions. In a second part of this thesis, we have also studied the deployment of multicast communications in hybrid ad hoc networks. A hybrid ad hoc network is an ad hoc network that has at least one node which can act as the gateway to the Internet. Our first objective has been to design a protocol which can be used to automatically assign IPv6 global addresses to the ad hoc nodes. Our proposal is based on the original concept of prefix continuity in an ad hoc network: the protocol creates and maintains sub-networks formed by an adjacent set of mobile nodes. We have evaluated different versions of our proposal with extensive simulations. Our second objective has then been to study the applicability of the prefix continuity concept in multicast communications in ad hoc networks. We have subsequently proposed a multicast routing protocol which creates multicast trees and meshes whose members all share an identical IPv6 network prefix. This architecture is very attractive in the sense that network management, access control, and billing systems can be easily deployed on the ad hoc gateways
46
Robichaud, Étienne. "Maximisation de l'autonomie énergétique d'un groupe de robots mobiles par auto-observation." [S.l. : s.n.], 2006.
Find full text
47
Almetlaq, Issam Y. "Mobile tactical HF/VHF EW system for ground forces." Thesis, Monterey, California. Naval Postgraduate School, 1989. http://hdl.handle.net/10945/27136.
Full text
48
Brink, Dahlström Mikaela. "Utvärdering av väderdata från fordonsbaserade nätverk." Thesis, Uppsala universitet, Luft-, vatten och landskapslära, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-315239.
Full textAbstract:
Fordonsbaserade mätningar av meteorologiska parametrar kan ge detaljerad väderinformation från en större täckande yta. Dagens bilar har redan flera monterade sensorer som kan användas för att skapa sådan information, exempelvis temperaturgivare eller vindrutetorkarnas hastighet som ett mått på nederbördsintensitet. Det finns även utrustning som kan monteras in och som efter vissa beräkningar ger däckens friktion mot underlaget. Om mätdata skickas direkt från fordonet till en databas kan väderinformationen tillhandahållas i realtid. I det här projektet utvärderas meteorologisk mätdata från sådana fordonsbaserade sensorer. Mätdata från en leverantör bearbetas och två perioder med mätdata från Göteborgsområdet undersöks. En längre period med mätningar från ett fordon och en kortare period med flera fordon. Den mätdata som används innehåller information om temperaturen och friktionskoefficienten. Arbetet har lett fram till en första metod för databehandling av fordonsbaserad mätdata, då ingen standardiserad metod finns ännu. En statistisk analys görs av mätdatas kvalitet, genom jämförelse med analysmodellen MESAN (Mesoskalig analys) samt genom jämförelse med data från VViS-stationer (VägVäderInformationsSystem). Det görs också en undersökning av korrelationer av temperaturdifferensen mellan fordon och MESAN med olika meteorologiska faktorer. De fordonsbaserade mätningarna har hög korrelation med modellen och stationerna, men visar generellt en högre temperatur. Bildata visar potentiellt också fler meteorologiska detaljer. Temperaturskillnaden är större i Göteborg centrum än utanför, vilket till stor del beror på fenomenet stadsvärmeö som inte representeras explicit i modellen. Temperaturskillnaden är också större vid högre temperaturer, som kan förklaras med vägarnas högre albedo och mindre evapotranspiration jämfört med omgivningen. En klimatologisk kartläggning av friktionskoefficienten har gjorts för månaderna februari till augusti samt för november. I det här arbetet syns inget tydligt samband mellan friktionskoefficienten och andra meteorologiska parametrar. Detta kan bero på den stora mänskliga påverkan på friktionen, exempelvis genom vinterväghållning. För att minska osäkerheten i resultaten krävs mer mätdata både i tid och rum, vilket kan betyda att mätdata från flera leverantörer bör analyseras. Att använda temperaturdata med större noggrannhet ökar potentialen att upptäcka fler och tydligare samband mellan temperaturen och de andra meteorologiska parametrarna som undersöks i den här studien.Environmental measurements from vehicle-based networks could provide detailed weather information from a greater area. The cars of today already have several sensors that could be used to create such data. For example thermometers and the speed of the windshield wipers as a measure of intensity of precipitation. There also exists sensors that could be mounted on to the car, which after calculations shows the amount of friction between the tires and the ground. If the data were to be sent directly to a database real time weather information could be provided. In this project the meteorological data from such vehicle-based sensores is assessed. Data from one provider is processed and two sets of data from the Gothenburg area in Sweden are analyzed. One set which contains data from a longer time period, with observations from only one vehicle. The other set contains data from a shorter time period with observations from several vehicles. The data collected contains information about air temperature and the coefficient of friction. This project has led to a first method of processing data from vehicle-based measurements, since no such standardized method yet exists. A statistical analysis of the quality of the observations was implemented by means of comparison with the analysis model MESAN (Mesoscale Analysis) and with observations from VViS-stations (VägVäderInformationsSystem). In addition an analysis of the correlation of the temperature difference between the vehicle and MESAN with some meteorological parameters were made. The vehicle-based measurements have a high correlation with the model and the stations but measures higher temperatures in general. The vehicle data potentially also shows more meteorological details. The difference in temperature is larger closer to the center of Gothenburg city than outside, in large part due to the phenomenon called Urban heat island which is not represented explicitly in the model. The temperature differences are also greater at higher temperatures, and can be explained by the higher albedo of the roads and less evapotranspiration compared to the surrounding environment. Climatological mapping of the coefficient of friction during February to August and during November were plotted. In this study no relation between the coefficient of friction and other meteorological parameters were found. This could be due to the human impact on friction, for example through snow clearing. To decrease the uncertaincy of the results more measurements are required both in time and space, which could infer that data from more providers would be needed. To use temperature data with higher accuracy increases the potential of finding more and more evident relations between the temperature and the other meteorological parameters that are analysed in this study.
49
Ahluwalia, Punit. "A Study of the Quality of Service in Group Oriented Mobile Transactions." Digital Archive @ GSU, 2006. http://digitalarchive.gsu.edu/cis_diss/7.
Full textAbstract:
In the emerging wireless Internet environment involving m-commerce and other mobile applications, an increasing number of users are likely to adopt mobile transactions. These transactions are likely to have very diverse requirements and some of them may require significant amount of network resources and/or bounded delays. Most quality-of-service research in wireless networks has hitherto focused on call or connection-level QoS. Many mobile transactions are expected to be distinct from the previously investigated applications in their criticality, level of resource required, and in their group characteristics. Examples of such transactions are ones involving a financial value. These unique requirements of mobile transactions necessitate introduction of new metrics for quality-of-service. To measure QoS effectiveness of mobile transactions, two new metrics, namely transaction completion probability and transaction response time are introduced in this research. Moreover, it is well known that wireless networks are constrained for bandwidth. Mobile transactions are expected to require varying degree of bandwidth which makes the resource allocation only at connection level very inefficient. This research proposes a new framework to support QoS requirements of mobile transactions by allocating bandwidth at connection and transaction levels. The proposed framework helps in achieving a balance between transaction completion probability and the response time. Simulation and analytical modeling are used to evaluate the QoS metrics under varying network and traffic scenarios and to validate the effectiveness of the new framework. The results show that the balanced transaction and connection level resource allocation can improve the probability of transactions completion and resource utilization but at the cost of slightly increased response time.
50
Mehrjerdi, Hasan. "Control and coordination for a group of mobile robots in unknown environments." Mémoire, École de technologie supérieure, 2010. http://espace.etsmtl.ca/652/1/MEHRJERDI_Hasan.pdf.
Full textAbstract:
Il existe de nombreuses applications pour lesquelles la tâche requise sera atteinte beaucoup
plus efficacement avec l’utilisation d’un groupe de robots mobiles comparativement à un
robot unique. Les groupes de robots mobiles peuvent obtenir les résultats souhaités avec
rapidité et précision, puisqu’il est possible de modifier chaque robot pour certaines tâches
spécifiques, ils deviennent idéaux pour les applications telles que le sauvetage, l'exploration
et le divertissement. Lorsqu’on compare l'issue de la mission d'un groupe de robots mobiles à
celle d'un robot unique, il est facile de voir que les performances du groupe de robots mobiles
améliorent la répartition des tâches spécifiques, la sécurité, la durée du temps nécessaire et
l'efficacité du système pour atteindre le résultat souhaité. Cette thèse étudie le suivi de la
trajectoire et le comportement coopératif pour un groupe de robots mobiles, fondés sur
l'utilisation d'algorithmes non linéaires et intelligents.
Afin de créer l'algorithme de contrôle le plus efficace pour le suivi des trajectoires, nous
présentons trois différentes techniques, soit la technique de Lyapunov, le contrôle intelligent
(commande floue) et une version exponentielle du mode de glissement. Les algorithmes
développés assurent la poursuite des trajectoires désignées tout en minimisant les erreurs.
Les résultats expérimentaux en utilisant un seul robot mobile sont présentés pour démontrer
le potentiel et la capacité des algorithmes développés.
Afin de coordonner un groupe de robots mobiles pour parvenir à un résultat commun, il est
nécessaire de créer une architecture efficace et un algorithme de contrôle, ce qui leur
permettra de travailler soit individuellement soit dans des formations robotiques organisées.
Ceci est réalisé en employant des techniques de suivi de trajectoires et de commandes de
coordination, en ayant une connaissance de la localisation des robots dans leur
environnement. Dans cette thèse, trois contrôleurs hiérarchiques différents sont présentés,
basés sur des techniques non linéaires et en se servant de l'asservissement par PID des roues
des robots afin de concevoir un algorithme qui démontrera à la fois la coopération et la
coordination d'une équipe de robots mobiles. Ces contrôleurs sont basés sur la technique de
Lyapunov, le contrôle intelligent (commande floue) et une version exponentielle du mode de
glissement.
Pour l’amélioration du suivi des trajectoires, chaque robot est muni de capteurs. Quand un
obstacle est détecté par l'un des capteurs, l'algorithme permet une manoeuvre incitant le robot
à se déplacer autour de l'obstacle en changeant sa vitesse et sa direction. En plus de
l'évitement d'obstacles, les contrôleurs permettent à tous les robots d’atteindre
simultanément leur destination respective en ajustant la vitesse de chaque robot
individuellement pendant que ceux-ci se déplacent le long de leur trajectoire prédéfinie.
Cela signifie que tout le groupe arrivera à destination en même temps, quelle que soit la
longueur de chaque parcours individuel ou le nombre d'obstacles rencontrés.
Les résultats expérimentaux obtenus en utilisant trois robots mobiles montrent la
performance de ces algorithmes de contrôle et le comportement de coopération et de
coordination par un groupe de robots.