the most current pursuit algorithms for moving targets which are presented so far in the literatureare pure pursuit and pure rendezvous navigations. recently, one of the present authors has introduced ageometric model for the pure pursuit navigation algorithm. here, in this paper, we study a new algorithm forthe pursuit navigation problem which is a combination of both of the above algorithms. ...

1. Abstract We introduce a pure process calculus and a value{passing process calculus in which the discipline of process interaction is not, as usual, the synchronous execution of actions but the service rendezvous (rendezvous). New is the following combination: (1) The rendezvous is a primitive. I.e. every particular rendezvous requires exactly one explicit synchronization between the processe...

This study analyzes rendezvous guidance schemes for UAVs refueling. Assuming the target is non-maneuvering with identical speed, a necessary condition investigated UAV to approach point. Three types of laws are considered analyze performance under condition. A reachable region analytically obtained using closed-form solution deviated pursuit and pure proportional navigation. Numerical simulatio...

Communication is Logically Instantaneous (li) when there is a logical time frame in which for each message, the send event and the corresponding delivery events occur simultaneously. li is stronger than Causally Ordered (co) communication, but weaker than Rendezvous (rdv) communication. This paper explores Logically Instantaneous communication and provides a simple and eecient protocol that imp...

Establishing communications in a dynamic spectrum access (DSA) network requires the communicating parties to “rendezvous” before transmitting their data packets. Frequency hopping (FH) provides an effective method for rendezvousing without relying on a predetermined control channel. Previous FH-based rendezvous designs do not account for fast primary user (PU) dynamics, which results in extreme...

Most common works for rendezvous in cognitive radio networks deal only with two user scenarios involving two secondary users and variable primary users and aim at reducing the time-to-rendezvous. A common control channel for the establishment of communication is not considered and hence the work comes under the category of ‘Blind Rendezvous’. Our work deal with multi-user scenario and provides ...

The rendezvous is a type of distributed decision tasks including many well-known tasks such as set agreement, simplex agreement, and approximation agreement. An ndimensional rendezvous task, n ≥ 1, allows n + 2 distinct input values, and each execution produces at most n + 2 distinct output values. A rendezvous task is said to implement another if an instance of its solution, followed by a prot...

In this paper, we propose a technique to synthesize a hardware circuit from a protocol specification consisting of several concurrent EFSMs with multi-rendezvous specified among their subsets. In our class, each multi-rendezvous can be specified among more than two EFSMs, and several multi-rendezvous can be specified for different combinations of EFSMs. In the proposed technique, using the info...