A connectivity preserving node permutation local method in limited range robotic networks

Limited communication range, together with mobility of robots, makes it crucial to design the control plans such that connectivity of a multi-robot network is maintained. Recently, many local and global connectivity maintenance schemes have been proposed to preserve connectivity of a robotic network...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Khateri, Koresh [verfasserIn] Pourgholi, Mahdi [verfasserIn] Montazeri, Mohsen [verfasserIn] Sabattini, Lorenzo [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2020

Schlagwörter:	Connectivity maintenance Local connectivity Multi-robot network Potential function

Übergeordnetes Werk:	Enthalten in: Robotics and autonomous systems - Amsterdam [u.a.] : Elsevier, 1988, 129
Übergeordnetes Werk:	volume:129

DOI / URN:	10.1016/j.robot.2020.103540

Katalog-ID:	ELV004154347

Internformat


LEADER	01000caa a22002652 4500
001	ELV004154347
003	DE-627
005	20230524130448.0
007	cr uuu---uuuuu
008	230502s2020 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1016/j.robot.2020.103540 \|2 doi
035			\|a (DE-627)ELV004154347
035			\|a (ELSEVIER)S0921-8890(19)30995-9
040			\|a DE-627 \|b ger \|c DE-627 \|e rda
041			\|a eng
082	0	4	\|a 620 \|q DE-600
084			\|a 50.25 \|2 bkl
084			\|a 54.72 \|2 bkl
100	1		\|a Khateri, Koresh \|e verfasserin \|0 (orcid)0000-0001-8820-8700 \|4 aut
245	1	0	\|a A connectivity preserving node permutation local method in limited range robotic networks
264		1	\|c 2020
336			\|a nicht spezifiziert \|b zzz \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a Limited communication range, together with mobility of robots, makes it crucial to design the control plans such that connectivity of a multi-robot network is maintained. Recently, many local and global connectivity maintenance schemes have been proposed to preserve connectivity of a robotic network. The traditional local connectivity maintenance method (LCM) is known to preserve every existing link, even though some of the existing connections might not be necessary for maintaining a path between each pair of robots, which is the aim of global connectivity maintenance (GCM) methods. However, the flexibility of movement provided by the global method costs restriction on speed and bandwidth. In this paper, a modified local connectivity maintenance method is provided to gain more flexibility of movement, while preserving the properties and simplicity of a local method. The proposed method is based on traditional local connectivity maintenance equipped with a basic operation to exchange the neighbors between two adjacent robots. Permutation of robots could be beneficial in many robotic applications such as exchanging the leader role in a V-formed robotic group or providing a path for a robot to reach its desired position while preserving the networks connectivity.
650		4	\|a Connectivity maintenance
650		4	\|a Local connectivity
650		4	\|a Multi-robot network
650		4	\|a Potential function
700	1		\|a Pourgholi, Mahdi \|e verfasserin \|0 (orcid)0000-0002-9679-1067 \|4 aut
700	1		\|a Montazeri, Mohsen \|e verfasserin \|0 (orcid)0000-0001-5248-1668 \|4 aut
700	1		\|a Sabattini, Lorenzo \|e verfasserin \|0 (orcid)0000-0002-2734-5549 \|4 aut
773	0	8	\|i Enthalten in \|t Robotics and autonomous systems \|d Amsterdam [u.a.] : Elsevier, 1988 \|g 129 \|h Online-Ressource \|w (DE-627)271597615 \|w (DE-600)1480750-6 \|w (DE-576)078708168 \|x 1872-793X \|7 nnns
773	1	8	\|g volume:129
912			\|a GBV_USEFLAG_U
912			\|a SYSFLAG_U
912			\|a GBV_ELV
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_32
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_74
912			\|a GBV_ILN_90
912			\|a GBV_ILN_95
912			\|a GBV_ILN_100
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_150
912			\|a GBV_ILN_151
912			\|a GBV_ILN_224
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_702
912			\|a GBV_ILN_2003
912			\|a GBV_ILN_2004
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2006
912			\|a GBV_ILN_2008
912			\|a GBV_ILN_2010
912			\|a GBV_ILN_2011
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_2015
912			\|a GBV_ILN_2020
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_2025
912			\|a GBV_ILN_2027
912			\|a GBV_ILN_2034
912			\|a GBV_ILN_2038
912			\|a GBV_ILN_2044
912			\|a GBV_ILN_2048
912			\|a GBV_ILN_2049
912			\|a GBV_ILN_2050
912			\|a GBV_ILN_2056
912			\|a GBV_ILN_2059
912			\|a GBV_ILN_2061
912			\|a GBV_ILN_2064
912			\|a GBV_ILN_2065
912			\|a GBV_ILN_2068
912			\|a GBV_ILN_2088
912			\|a GBV_ILN_2111
912			\|a GBV_ILN_2112
912			\|a GBV_ILN_2113
912			\|a GBV_ILN_2118
912			\|a GBV_ILN_2122
912			\|a GBV_ILN_2129
912			\|a GBV_ILN_2143
912			\|a GBV_ILN_2147
912			\|a GBV_ILN_2148
912			\|a GBV_ILN_2152
912			\|a GBV_ILN_2153
912			\|a GBV_ILN_2190
912			\|a GBV_ILN_2336
912			\|a GBV_ILN_2470
912			\|a GBV_ILN_2507
912			\|a GBV_ILN_2522
912			\|a GBV_ILN_4035
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4046
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4242
912			\|a GBV_ILN_4251
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4326
912			\|a GBV_ILN_4333
912			\|a GBV_ILN_4334
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4393
936	b	k	\|a 50.25 \|j Robotertechnik
936	b	k	\|a 54.72 \|j Künstliche Intelligenz
951			\|a AR
952			\|d 129

Indexfelder

author_variant	k k kk m p mp m m mm l s ls
matchkey_str	article:1872793X:2020----::cnetvtpeevnndpruainoamtoilmt
hierarchy_sort_str	2020
bklnumber	50.25 54.72
publishDate	2020
allfields	10.1016/j.robot.2020.103540 doi (DE-627)ELV004154347 (ELSEVIER)S0921-8890(19)30995-9 DE-627 ger DE-627 rda eng 620 DE-600 50.25 bkl 54.72 bkl Khateri, Koresh verfasserin (orcid)0000-0001-8820-8700 aut A connectivity preserving node permutation local method in limited range robotic networks 2020 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Limited communication range, together with mobility of robots, makes it crucial to design the control plans such that connectivity of a multi-robot network is maintained. Recently, many local and global connectivity maintenance schemes have been proposed to preserve connectivity of a robotic network. The traditional local connectivity maintenance method (LCM) is known to preserve every existing link, even though some of the existing connections might not be necessary for maintaining a path between each pair of robots, which is the aim of global connectivity maintenance (GCM) methods. However, the flexibility of movement provided by the global method costs restriction on speed and bandwidth. In this paper, a modified local connectivity maintenance method is provided to gain more flexibility of movement, while preserving the properties and simplicity of a local method. The proposed method is based on traditional local connectivity maintenance equipped with a basic operation to exchange the neighbors between two adjacent robots. Permutation of robots could be beneficial in many robotic applications such as exchanging the leader role in a V-formed robotic group or providing a path for a robot to reach its desired position while preserving the networks connectivity. Connectivity maintenance Local connectivity Multi-robot network Potential function Pourgholi, Mahdi verfasserin (orcid)0000-0002-9679-1067 aut Montazeri, Mohsen verfasserin (orcid)0000-0001-5248-1668 aut Sabattini, Lorenzo verfasserin (orcid)0000-0002-2734-5549 aut Enthalten in Robotics and autonomous systems Amsterdam [u.a.] : Elsevier, 1988 129 Online-Ressource (DE-627)271597615 (DE-600)1480750-6 (DE-576)078708168 1872-793X nnns volume:129 GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 50.25 Robotertechnik 54.72 Künstliche Intelligenz AR 129
spelling	10.1016/j.robot.2020.103540 doi (DE-627)ELV004154347 (ELSEVIER)S0921-8890(19)30995-9 DE-627 ger DE-627 rda eng 620 DE-600 50.25 bkl 54.72 bkl Khateri, Koresh verfasserin (orcid)0000-0001-8820-8700 aut A connectivity preserving node permutation local method in limited range robotic networks 2020 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Limited communication range, together with mobility of robots, makes it crucial to design the control plans such that connectivity of a multi-robot network is maintained. Recently, many local and global connectivity maintenance schemes have been proposed to preserve connectivity of a robotic network. The traditional local connectivity maintenance method (LCM) is known to preserve every existing link, even though some of the existing connections might not be necessary for maintaining a path between each pair of robots, which is the aim of global connectivity maintenance (GCM) methods. However, the flexibility of movement provided by the global method costs restriction on speed and bandwidth. In this paper, a modified local connectivity maintenance method is provided to gain more flexibility of movement, while preserving the properties and simplicity of a local method. The proposed method is based on traditional local connectivity maintenance equipped with a basic operation to exchange the neighbors between two adjacent robots. Permutation of robots could be beneficial in many robotic applications such as exchanging the leader role in a V-formed robotic group or providing a path for a robot to reach its desired position while preserving the networks connectivity. Connectivity maintenance Local connectivity Multi-robot network Potential function Pourgholi, Mahdi verfasserin (orcid)0000-0002-9679-1067 aut Montazeri, Mohsen verfasserin (orcid)0000-0001-5248-1668 aut Sabattini, Lorenzo verfasserin (orcid)0000-0002-2734-5549 aut Enthalten in Robotics and autonomous systems Amsterdam [u.a.] : Elsevier, 1988 129 Online-Ressource (DE-627)271597615 (DE-600)1480750-6 (DE-576)078708168 1872-793X nnns volume:129 GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 50.25 Robotertechnik 54.72 Künstliche Intelligenz AR 129
allfields_unstemmed	10.1016/j.robot.2020.103540 doi (DE-627)ELV004154347 (ELSEVIER)S0921-8890(19)30995-9 DE-627 ger DE-627 rda eng 620 DE-600 50.25 bkl 54.72 bkl Khateri, Koresh verfasserin (orcid)0000-0001-8820-8700 aut A connectivity preserving node permutation local method in limited range robotic networks 2020 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Limited communication range, together with mobility of robots, makes it crucial to design the control plans such that connectivity of a multi-robot network is maintained. Recently, many local and global connectivity maintenance schemes have been proposed to preserve connectivity of a robotic network. The traditional local connectivity maintenance method (LCM) is known to preserve every existing link, even though some of the existing connections might not be necessary for maintaining a path between each pair of robots, which is the aim of global connectivity maintenance (GCM) methods. However, the flexibility of movement provided by the global method costs restriction on speed and bandwidth. In this paper, a modified local connectivity maintenance method is provided to gain more flexibility of movement, while preserving the properties and simplicity of a local method. The proposed method is based on traditional local connectivity maintenance equipped with a basic operation to exchange the neighbors between two adjacent robots. Permutation of robots could be beneficial in many robotic applications such as exchanging the leader role in a V-formed robotic group or providing a path for a robot to reach its desired position while preserving the networks connectivity. Connectivity maintenance Local connectivity Multi-robot network Potential function Pourgholi, Mahdi verfasserin (orcid)0000-0002-9679-1067 aut Montazeri, Mohsen verfasserin (orcid)0000-0001-5248-1668 aut Sabattini, Lorenzo verfasserin (orcid)0000-0002-2734-5549 aut Enthalten in Robotics and autonomous systems Amsterdam [u.a.] : Elsevier, 1988 129 Online-Ressource (DE-627)271597615 (DE-600)1480750-6 (DE-576)078708168 1872-793X nnns volume:129 GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 50.25 Robotertechnik 54.72 Künstliche Intelligenz AR 129
allfieldsGer	10.1016/j.robot.2020.103540 doi (DE-627)ELV004154347 (ELSEVIER)S0921-8890(19)30995-9 DE-627 ger DE-627 rda eng 620 DE-600 50.25 bkl 54.72 bkl Khateri, Koresh verfasserin (orcid)0000-0001-8820-8700 aut A connectivity preserving node permutation local method in limited range robotic networks 2020 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Limited communication range, together with mobility of robots, makes it crucial to design the control plans such that connectivity of a multi-robot network is maintained. Recently, many local and global connectivity maintenance schemes have been proposed to preserve connectivity of a robotic network. The traditional local connectivity maintenance method (LCM) is known to preserve every existing link, even though some of the existing connections might not be necessary for maintaining a path between each pair of robots, which is the aim of global connectivity maintenance (GCM) methods. However, the flexibility of movement provided by the global method costs restriction on speed and bandwidth. In this paper, a modified local connectivity maintenance method is provided to gain more flexibility of movement, while preserving the properties and simplicity of a local method. The proposed method is based on traditional local connectivity maintenance equipped with a basic operation to exchange the neighbors between two adjacent robots. Permutation of robots could be beneficial in many robotic applications such as exchanging the leader role in a V-formed robotic group or providing a path for a robot to reach its desired position while preserving the networks connectivity. Connectivity maintenance Local connectivity Multi-robot network Potential function Pourgholi, Mahdi verfasserin (orcid)0000-0002-9679-1067 aut Montazeri, Mohsen verfasserin (orcid)0000-0001-5248-1668 aut Sabattini, Lorenzo verfasserin (orcid)0000-0002-2734-5549 aut Enthalten in Robotics and autonomous systems Amsterdam [u.a.] : Elsevier, 1988 129 Online-Ressource (DE-627)271597615 (DE-600)1480750-6 (DE-576)078708168 1872-793X nnns volume:129 GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 50.25 Robotertechnik 54.72 Künstliche Intelligenz AR 129
allfieldsSound	10.1016/j.robot.2020.103540 doi (DE-627)ELV004154347 (ELSEVIER)S0921-8890(19)30995-9 DE-627 ger DE-627 rda eng 620 DE-600 50.25 bkl 54.72 bkl Khateri, Koresh verfasserin (orcid)0000-0001-8820-8700 aut A connectivity preserving node permutation local method in limited range robotic networks 2020 nicht spezifiziert zzz rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Limited communication range, together with mobility of robots, makes it crucial to design the control plans such that connectivity of a multi-robot network is maintained. Recently, many local and global connectivity maintenance schemes have been proposed to preserve connectivity of a robotic network. The traditional local connectivity maintenance method (LCM) is known to preserve every existing link, even though some of the existing connections might not be necessary for maintaining a path between each pair of robots, which is the aim of global connectivity maintenance (GCM) methods. However, the flexibility of movement provided by the global method costs restriction on speed and bandwidth. In this paper, a modified local connectivity maintenance method is provided to gain more flexibility of movement, while preserving the properties and simplicity of a local method. The proposed method is based on traditional local connectivity maintenance equipped with a basic operation to exchange the neighbors between two adjacent robots. Permutation of robots could be beneficial in many robotic applications such as exchanging the leader role in a V-formed robotic group or providing a path for a robot to reach its desired position while preserving the networks connectivity. Connectivity maintenance Local connectivity Multi-robot network Potential function Pourgholi, Mahdi verfasserin (orcid)0000-0002-9679-1067 aut Montazeri, Mohsen verfasserin (orcid)0000-0001-5248-1668 aut Sabattini, Lorenzo verfasserin (orcid)0000-0002-2734-5549 aut Enthalten in Robotics and autonomous systems Amsterdam [u.a.] : Elsevier, 1988 129 Online-Ressource (DE-627)271597615 (DE-600)1480750-6 (DE-576)078708168 1872-793X nnns volume:129 GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393 50.25 Robotertechnik 54.72 Künstliche Intelligenz AR 129
language	English
source	Enthalten in Robotics and autonomous systems 129 volume:129
sourceStr	Enthalten in Robotics and autonomous systems 129 volume:129
format_phy_str_mv	Article
bklname	Robotertechnik Künstliche Intelligenz
institution	findex.gbv.de
topic_facet	Connectivity maintenance Local connectivity Multi-robot network Potential function
dewey-raw	620
isfreeaccess_bool	false
container_title	Robotics and autonomous systems
authorswithroles_txt_mv	Khateri, Koresh @@aut@@ Pourgholi, Mahdi @@aut@@ Montazeri, Mohsen @@aut@@ Sabattini, Lorenzo @@aut@@
publishDateDaySort_date	2020-01-01T00:00:00Z
hierarchy_top_id	271597615
dewey-sort	3620
id	ELV004154347
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV004154347</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230524130448.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230502s2020 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.robot.2020.103540</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV004154347</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0921-8890(19)30995-9</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">50.25</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.72</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Khateri, Koresh</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0001-8820-8700</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A connectivity preserving node permutation local method in limited range robotic networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Limited communication range, together with mobility of robots, makes it crucial to design the control plans such that connectivity of a multi-robot network is maintained. Recently, many local and global connectivity maintenance schemes have been proposed to preserve connectivity of a robotic network. The traditional local connectivity maintenance method (LCM) is known to preserve every existing link, even though some of the existing connections might not be necessary for maintaining a path between each pair of robots, which is the aim of global connectivity maintenance (GCM) methods. However, the flexibility of movement provided by the global method costs restriction on speed and bandwidth. In this paper, a modified local connectivity maintenance method is provided to gain more flexibility of movement, while preserving the properties and simplicity of a local method. The proposed method is based on traditional local connectivity maintenance equipped with a basic operation to exchange the neighbors between two adjacent robots. Permutation of robots could be beneficial in many robotic applications such as exchanging the leader role in a V-formed robotic group or providing a path for a robot to reach its desired position while preserving the networks connectivity.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Connectivity maintenance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Local connectivity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multi-robot network</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Potential function</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pourgholi, Mahdi</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-9679-1067</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Montazeri, Mohsen</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0001-5248-1668</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sabattini, Lorenzo</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-2734-5549</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Robotics and autonomous systems</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1988</subfield><subfield code="g">129</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)271597615</subfield><subfield code="w">(DE-600)1480750-6</subfield><subfield code="w">(DE-576)078708168</subfield><subfield code="x">1872-793X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">50.25</subfield><subfield code="j">Robotertechnik</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.72</subfield><subfield code="j">Künstliche Intelligenz</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">129</subfield></datafield></record></collection>
author	Khateri, Koresh
spellingShingle	Khateri, Koresh ddc 620 bkl 50.25 bkl 54.72 misc Connectivity maintenance misc Local connectivity misc Multi-robot network misc Potential function A connectivity preserving node permutation local method in limited range robotic networks
authorStr	Khateri, Koresh
ppnlink_with_tag_str_mv	@@773@@(DE-627)271597615
format	electronic Article
dewey-ones	620 - Engineering & allied operations
delete_txt_mv	keep
author_role	aut aut aut aut
collection	elsevier
remote_str	true
illustrated	Not Illustrated
issn	1872-793X
topic_title	620 DE-600 50.25 bkl 54.72 bkl A connectivity preserving node permutation local method in limited range robotic networks Connectivity maintenance Local connectivity Multi-robot network Potential function
topic	ddc 620 bkl 50.25 bkl 54.72 misc Connectivity maintenance misc Local connectivity misc Multi-robot network misc Potential function
topic_unstemmed	ddc 620 bkl 50.25 bkl 54.72 misc Connectivity maintenance misc Local connectivity misc Multi-robot network misc Potential function
topic_browse	ddc 620 bkl 50.25 bkl 54.72 misc Connectivity maintenance misc Local connectivity misc Multi-robot network misc Potential function
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	Robotics and autonomous systems
hierarchy_parent_id	271597615
dewey-tens	620 - Engineering
hierarchy_top_title	Robotics and autonomous systems
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)271597615 (DE-600)1480750-6 (DE-576)078708168
title	A connectivity preserving node permutation local method in limited range robotic networks
ctrlnum	(DE-627)ELV004154347 (ELSEVIER)S0921-8890(19)30995-9
title_full	A connectivity preserving node permutation local method in limited range robotic networks
author_sort	Khateri, Koresh
journal	Robotics and autonomous systems
journalStr	Robotics and autonomous systems
lang_code	eng
isOA_bool	false
dewey-hundreds	600 - Technology
recordtype	marc
publishDateSort	2020
contenttype_str_mv	zzz
author_browse	Khateri, Koresh Pourgholi, Mahdi Montazeri, Mohsen Sabattini, Lorenzo
container_volume	129
class	620 DE-600 50.25 bkl 54.72 bkl
format_se	Elektronische Aufsätze
author-letter	Khateri, Koresh
doi_str_mv	10.1016/j.robot.2020.103540
normlink	(ORCID)0000-0001-8820-8700 (ORCID)0000-0002-9679-1067 (ORCID)0000-0001-5248-1668 (ORCID)0000-0002-2734-5549
normlink_prefix_str_mv	(orcid)0000-0001-8820-8700 (orcid)0000-0002-9679-1067 (orcid)0000-0001-5248-1668 (orcid)0000-0002-2734-5549
dewey-full	620
author2-role	verfasserin
title_sort	a connectivity preserving node permutation local method in limited range robotic networks
title_auth	A connectivity preserving node permutation local method in limited range robotic networks
abstract	Limited communication range, together with mobility of robots, makes it crucial to design the control plans such that connectivity of a multi-robot network is maintained. Recently, many local and global connectivity maintenance schemes have been proposed to preserve connectivity of a robotic network. The traditional local connectivity maintenance method (LCM) is known to preserve every existing link, even though some of the existing connections might not be necessary for maintaining a path between each pair of robots, which is the aim of global connectivity maintenance (GCM) methods. However, the flexibility of movement provided by the global method costs restriction on speed and bandwidth. In this paper, a modified local connectivity maintenance method is provided to gain more flexibility of movement, while preserving the properties and simplicity of a local method. The proposed method is based on traditional local connectivity maintenance equipped with a basic operation to exchange the neighbors between two adjacent robots. Permutation of robots could be beneficial in many robotic applications such as exchanging the leader role in a V-formed robotic group or providing a path for a robot to reach its desired position while preserving the networks connectivity.
abstractGer	Limited communication range, together with mobility of robots, makes it crucial to design the control plans such that connectivity of a multi-robot network is maintained. Recently, many local and global connectivity maintenance schemes have been proposed to preserve connectivity of a robotic network. The traditional local connectivity maintenance method (LCM) is known to preserve every existing link, even though some of the existing connections might not be necessary for maintaining a path between each pair of robots, which is the aim of global connectivity maintenance (GCM) methods. However, the flexibility of movement provided by the global method costs restriction on speed and bandwidth. In this paper, a modified local connectivity maintenance method is provided to gain more flexibility of movement, while preserving the properties and simplicity of a local method. The proposed method is based on traditional local connectivity maintenance equipped with a basic operation to exchange the neighbors between two adjacent robots. Permutation of robots could be beneficial in many robotic applications such as exchanging the leader role in a V-formed robotic group or providing a path for a robot to reach its desired position while preserving the networks connectivity.
abstract_unstemmed	Limited communication range, together with mobility of robots, makes it crucial to design the control plans such that connectivity of a multi-robot network is maintained. Recently, many local and global connectivity maintenance schemes have been proposed to preserve connectivity of a robotic network. The traditional local connectivity maintenance method (LCM) is known to preserve every existing link, even though some of the existing connections might not be necessary for maintaining a path between each pair of robots, which is the aim of global connectivity maintenance (GCM) methods. However, the flexibility of movement provided by the global method costs restriction on speed and bandwidth. In this paper, a modified local connectivity maintenance method is provided to gain more flexibility of movement, while preserving the properties and simplicity of a local method. The proposed method is based on traditional local connectivity maintenance equipped with a basic operation to exchange the neighbors between two adjacent robots. Permutation of robots could be beneficial in many robotic applications such as exchanging the leader role in a V-formed robotic group or providing a path for a robot to reach its desired position while preserving the networks connectivity.
collection_details	GBV_USEFLAG_U SYSFLAG_U GBV_ELV GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_32 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_74 GBV_ILN_90 GBV_ILN_95 GBV_ILN_100 GBV_ILN_105 GBV_ILN_110 GBV_ILN_150 GBV_ILN_151 GBV_ILN_224 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2003 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2011 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2025 GBV_ILN_2027 GBV_ILN_2034 GBV_ILN_2038 GBV_ILN_2044 GBV_ILN_2048 GBV_ILN_2049 GBV_ILN_2050 GBV_ILN_2056 GBV_ILN_2059 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_2065 GBV_ILN_2068 GBV_ILN_2088 GBV_ILN_2111 GBV_ILN_2112 GBV_ILN_2113 GBV_ILN_2118 GBV_ILN_2122 GBV_ILN_2129 GBV_ILN_2143 GBV_ILN_2147 GBV_ILN_2148 GBV_ILN_2152 GBV_ILN_2153 GBV_ILN_2190 GBV_ILN_2336 GBV_ILN_2470 GBV_ILN_2507 GBV_ILN_2522 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4046 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4333 GBV_ILN_4334 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4393
title_short	A connectivity preserving node permutation local method in limited range robotic networks
remote_bool	true
author2	Pourgholi, Mahdi Montazeri, Mohsen Sabattini, Lorenzo
author2Str	Pourgholi, Mahdi Montazeri, Mohsen Sabattini, Lorenzo
ppnlink	271597615
mediatype_str_mv	c
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1016/j.robot.2020.103540
up_date	2024-07-06T22:02:00.604Z
_version_	1803868774707757056
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">ELV004154347</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230524130448.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230502s2020 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1016/j.robot.2020.103540</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)ELV004154347</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ELSEVIER)S0921-8890(19)30995-9</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">DE-600</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">50.25</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.72</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Khateri, Koresh</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0001-8820-8700</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A connectivity preserving node permutation local method in limited range robotic networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2020</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Limited communication range, together with mobility of robots, makes it crucial to design the control plans such that connectivity of a multi-robot network is maintained. Recently, many local and global connectivity maintenance schemes have been proposed to preserve connectivity of a robotic network. The traditional local connectivity maintenance method (LCM) is known to preserve every existing link, even though some of the existing connections might not be necessary for maintaining a path between each pair of robots, which is the aim of global connectivity maintenance (GCM) methods. However, the flexibility of movement provided by the global method costs restriction on speed and bandwidth. In this paper, a modified local connectivity maintenance method is provided to gain more flexibility of movement, while preserving the properties and simplicity of a local method. The proposed method is based on traditional local connectivity maintenance equipped with a basic operation to exchange the neighbors between two adjacent robots. Permutation of robots could be beneficial in many robotic applications such as exchanging the leader role in a V-formed robotic group or providing a path for a robot to reach its desired position while preserving the networks connectivity.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Connectivity maintenance</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Local connectivity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multi-robot network</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Potential function</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pourgholi, Mahdi</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-9679-1067</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Montazeri, Mohsen</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0001-5248-1668</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sabattini, Lorenzo</subfield><subfield code="e">verfasserin</subfield><subfield code="0">(orcid)0000-0002-2734-5549</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Robotics and autonomous systems</subfield><subfield code="d">Amsterdam [u.a.] : Elsevier, 1988</subfield><subfield code="g">129</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)271597615</subfield><subfield code="w">(DE-600)1480750-6</subfield><subfield code="w">(DE-576)078708168</subfield><subfield code="x">1872-793X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_U</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ELV</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_74</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_90</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_224</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2003</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2011</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2025</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2027</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2034</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2038</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2044</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2049</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2056</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2059</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2065</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2068</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2111</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2113</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2118</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2122</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2129</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2143</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2147</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2148</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2152</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2153</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2336</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2470</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2507</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2522</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4393</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">50.25</subfield><subfield code="j">Robotertechnik</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.72</subfield><subfield code="j">Künstliche Intelligenz</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">129</subfield></datafield></record></collection>
score	7.4023256

Nicht das Richtige dabei?

Schreiben Sie uns!

A connectivity preserving node permutation local method in limited range robotic networks

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?