@prefix epid: .
@prefix dc: .
@prefix geo: .
@prefix bibo: .
@prefix epx: .
@prefix owl: .
@prefix void: .
@prefix event: .
@prefix skos: .
@prefix xsd: .
@prefix cc: .
@prefix ep: .
@prefix foaf: .
@prefix rdf: .
@prefix rdfs: .
@prefix eprel: .
@prefix dct: .
<>
foaf:primaryTopic ;
rdfs:comment "The repository administrator has not yet configured an RDF license."^^xsd:string .
rdfs:label "mazer98a.pdf"^^xsd:string .
rdfs:label "preview.png"^^xsd:string .
rdfs:label "indexcodes.txt"^^xsd:string .
dc:format "text/html";
dc:title "HTML Summary of #3751 \n\nThe Ariadne's Clew Algorithm\n\n";
foaf:primaryTopic .
dct:hasPart ;
ep:hasFile ;
eprel:hasIndexCodesVersion ;
eprel:hasVersion ,
;
eprel:hasVolatileVersion ,
;
eprel:haspreviewThumbnailVersion ;
rdf:type bibo:Document,
ep:Document;
rdfs:label "The Ariadne's Clew Algorithm (PDF)"^^xsd:string .
dct:hasPart ;
ep:hasFile ;
eprel:isVersionOf ;
eprel:isVolatileVersionOf ;
eprel:ispreviewThumbnailVersionOf ;
rdf:type ep:Document;
rdfs:label "The Ariadne's Clew Algorithm (Image (PNG))"^^xsd:string .
dct:hasPart ;
ep:hasFile ;
eprel:isIndexCodesVersionOf ;
eprel:isVersionOf ;
eprel:isVolatileVersionOf ;
rdf:type ep:Document;
rdfs:label "The Ariadne's Clew Algorithm (Indexer Terms)"^^xsd:string .
rdf:_1 ;
rdf:_2 ;
rdf:_3 .
bibo:abstract "We present a new approach to path planning, called the ``Ariadne's clew algorithm''. It is designed to find paths in high-dimensional continuous spaces and applies to robots with many degrees of freedom in static, as well as dynamic environments --- ones where obstacles may move. The Ariadne's clew algorithm comprises two sub-algorithms, called SEARCH and EXPLORE, applied in an interleaved manner. EXPLORE builds a representation of the accessible space while SEARCH looks for the target. Both are posed as optimization problems. We describe a real implementation of the algorithm to plan paths for a six degrees of freedom arm in a dynamic environment where another six degrees of freedom arm is used as a moving obstacle. Experimental results show that a path is found in about one second without any pre-processing."^^xsd:string;
bibo:authorList ;
bibo:status ,
;
bibo:volume "9";
dct:creator ,
,
;
dct:date "1998";
dct:isPartOf ,
;
dct:subject ;
dct:title "The Ariadne's Clew Algorithm"^^xsd:string;
ep:hasDocument ,
,
;
rdf:type bibo:Article,
ep:EPrint,
ep:JournalpEPrint;
rdfs:seeAlso .
rdf:type skos:Concept;
skos:prefLabel "Robotics" .
foaf:familyName "Bessiere"^^xsd:string;
foaf:givenName "P"^^xsd:string;
foaf:name "P Bessiere"^^xsd:string;
rdf:type foaf:Person .
foaf:familyName "Mazer"^^xsd:string;
foaf:givenName "E"^^xsd:string;
foaf:name "E Mazer"^^xsd:string;
rdf:type foaf:Person .
foaf:familyName "Ahuactzin"^^xsd:string;
foaf:givenName "J-M"^^xsd:string;
foaf:name "J-M Ahuactzin"^^xsd:string;
rdf:type foaf:Person .
foaf:name "Journal of Artificial Intelligence Research (JAIR)"^^xsd:string;
rdf:type bibo:Collection .