Rendezvous Algorithm for Disconnected Topologies
| dc.contributor.author | Silvestre, Daniel | |
| dc.date.accessioned | 2020-12-04T11:46:30Z | |
| dc.date.available | 2020-12-04T11:46:30Z | |
| dc.date.issued | 2020-09 | |
| dc.description.abstract | Multi-Agent Systems (MAS) - a network composed of mobile agents with the objective of converging to a single location. No centralized infrastructure - implies the need for a decentralized algorithm to compute the actuation. Applicable to exploration missions - a group of robots with the target of sensing as much ground as possible. Typical solutions use consensus algorithms [1] [2], can cope with asymmetric wireless links. Consensus algorithms can be made to work with noisy measurements [3]. | |
| dc.identifier.uri | http://hdl.handle.net/11144/4668 | |
| dc.language.iso | eng | pt_PT |
| dc.peerreviewed | yes | pt_PT |
| dc.rights | open access | pt_PT |
| dc.title | Rendezvous Algorithm for Disconnected Topologies | pt_PT |
| dc.type | conferenceObject | pt_PT |
| dspace.entity.type | Publication | en |
Files
Original bundle
1 - 1 of 1