Path-constrained rendezvous is the process of moving an orbiting object from its current position to a desired position and velocity, in such a way that no obstacles are contacted along the way. It is a more constrained instance of the general problem of orbital rendezvous.
When no obstacles are a consideration, the problem of rendezvous is straightforward, and many efficient algorithms are available to plan the necessary maneuvers. Depending on the desired time taken to accomplish the rendezvous, there are literally an infinite number of possible rendezvous paths.
The presence of obstacles posing a collision risk complicates the problem. The shortest-time or lowest-energy rendezvous might be made infeasible by obstacles, so a path requiring more time or more energy would have to be employed. For instance, if the purpose of the rendezvous is to rescue an astronaut in distress on the far side of a large space station, one might well need quickly to find the rescue path requiring minimal time to execute, yet avoiding contact with the space station structure.
A natural object of study is the problem of maneuvering in the vicinity of a large orbiting sphere, since a collision with a more complex structure can be avoided by selecting rendezvous paths that avoid contact with a virtual sphere enclosing the structure. Early research considered the problem of departure and arrival points lying on the surface of an orbiting sphere. This led to a pair of necessary conditions called the Tangential Departure and Tangential Arrival conditions.