About: Path-constrained rendezvous

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Path-constrained rendezvous Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Election, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FPath-constrained_rendezvous&graph=http%3A%2F%2Fdbpedia.org&graph=http%3A%2F%2Fdbpedia.org

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 need 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 an infinite number of possible rendezvous paths.

Attributes	Values
rdf:type	yago:WikicatOrbits yago:Line108593262 yago:Location100027167 yago:Object100002684 yago:Orbit108612049 yago:Path108616311 yago:PhysicalEntity100001930 yago:YagoGeoEntity yago:YagoLegalActorGeo yago:YagoPermanentlyLocatedEntity Election
rdfs:label	Path-constrained rendezvous (en)
rdfs:comment	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 need 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 an infinite number of possible rendezvous paths. (en)
dcterms:subject	Astrodynamics Orbits
Wikipage page ID	4790698 (xsd:integer)
Wikipage revision ID	1009247774 (xsd:integer)
Link from a Wikipage to another Wikipage	Astrodynamics Orbits Orbit Astronaut Space rendezvous Sphere Orbital maneuver Space station
Link from a Wikipage to an external page	http://arc.aiaa.org/doi/abs/10.2514/3.25835%3FjournalCode=jsr http://arc.aiaa.org/doi/abs/10.2514/3.25912%3FjournalCode=jsr http://arc.aiaa.org/doi/abs/10.2514/6.1985-1916 http://adsabs.harvard.edu/abs/1989ommd.proc..103S
sameAs	Path-constrained rendezvous Path-constrained rendezvous Path-constrained rendezvous Path-constrained rendezvous
dbp:wikiPageUsesTemplate	dbt:Portal dbt:Reflist dbt:Short_description dbt:Spacecraft-stub
has abstract	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 need 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 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 is to rescue an astronaut in distress on the far side of a large space station, speed is important. One may have to find quickly 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. (en)
gold:hypernym	Process
prov:wasDerivedFrom	wikipedia-en:Path-constrained_rendezvous?oldid=1009247774&ns=0
page length (characters) of wiki page	3754 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Path-constrained_rendezvous
is Link from a Wikipage to another Wikipage of	Path-constrained Rendezvous Space rendezvous
is Wikipage redirect of	Path-constrained Rendezvous
is foaf:primaryTopic of	wikipedia-en:Path-constrained_rendezvous

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (61 GB total memory, 51 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software