A group of wheeled robots with nonholonomic constraints is considered to rendezvous at a common specified setpoint with a desired orientation while maintaining network connectivity and ensuring collision avoidance within the robots. Given communication and sensing constraints for each robot, only a subset of the robots are aware or informed of the global destination, and the remaining robots mu...

Web applications that offer entertainment rarely support knowledge sharing. Conversely, applications that are intended for knowledge sharing rarely offer entertainment. The intent of this paper is therefore to propose the coalescence of knowledge sharing and entertainment in a Web application. The objectives of this paper are twofold: (1) to introduce a prototype called Rendezvous, which serves...

Parallel rendezvous multi-channel MAC mechanisms are regarded as an efficient method for media access control in cognitive radio networks since they do not need a control channel and use only one transceiver. However, existing parallel rendezvous MAC mechanisms assume that all channels have the same maximum capacity and channel availability for secondary users. In this paper, we propose a dynam...

In this paper, we propose a solution to the problem on how cognitive radios can find each other. The easiest and common practice to address this problem is to have a dedicated control channel on which the nodes can rendezvous with each other. However, a dedicated Common Control Channel (CCC) has severe drawbacks. As a solution to this drawback, we propose a rendezvous channel (RC) setup scheme ...

Low power multihop infrastructure will be increasingly used to provide connectivity in wireless battery-operated radio networks [1]. In this type of network, the applications and services will often vary with time, and thus the minimum power consumption of the system will also be timevarying. In this paper we propose a generalized rendezvous reservation protocol (RRP) which permits low power mu...

Before a session in a synchronous, collaborative environment can really start, various actions have to be performed: users have to be informed about planned sessions, network access paths between session participants have to be determined, etc. In the following, we call all these actions group rendezvous. In existing groupware systems, the group rendezvous is often neglected, i.e. it is assumed...

We study the problem of gathering at the same location two mobile agents that are dispersed in an unknown and unlabeled environment. This problem called Rendezvous, is a fundamental task in distributed coordination among autonomous entities. Most previous studies on the subject model the environment as an undirected graph and the solution techniques rely heavily on the fact that an agent can ba...

This paper investigates a systematic mission design of robust and optimal orbital transfer maneuvers for a sample return mission from an asteroid. In this study, an interplanetary space flight mission design is established to obtain the minimum ∆V required for a rendezvous and sample return mission from an asteroid. Given the initial (observed) conditions of an asteroid, a (robust) genetic algo...

Distributed or parallel software with synchronous communication via rendezvous is found in client-server systems and in proposed Open Distributed Systems, in implementation environments such as Ada, V, Remote Procedure Call systems, in Transputer systems, and in speciication techniques such as CSP, CCS and LOTOS. The delays induced by rendezvous can cause serious performance problems, which are...

We study the rendezvous problem in the asynchronous setting in the graph of infinite line following the model introduced in [13]. We formulate general lemmas about deterministic rendezvous algorithms in this setting which characterize the algorithms in which the agents have the shortest routes. We also improve rendezvous algorithms in the infinite line which formulated in [13]. Two agents have ...