The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this work the connectivity preserving problem of multiple agents with limited communication ranges in the context of rendezvous tasks has been investigated. The communication among agents is considered to be unreliable and the control inputs of agents are required to be bounded. Based on the explicitly defined virtual neighbors, the proximity graph connectivity of the agent group has been preserved...
In this paper, we investigate the coordination problem of multiple robots with limited communication ranges and communication failures. A novel rendezvous algorithm via proximity graph is developed so that the robot group can achieve rendezvous when the communication links satisfy an ergodic assumption. The convergence proof of the algorithm is established based on the tools from rooted graph theory...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.