{"id":"https://openalex.org/W2008999033","doi":"https://doi.org/10.1145/1478462.1478481","title":"An efficient algorithm for optimum trajectory computation","display_name":"An efficient algorithm for optimum trajectory computation","publication_year":1970,"publication_date":"1970-01-01","ids":{"openalex":"https://openalex.org/W2008999033","doi":"https://doi.org/10.1145/1478462.1478481","mag":"2008999033"},"language":"en","primary_location":{"id":"doi:10.1145/1478462.1478481","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1478462.1478481","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1478462.1478481","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the November 17-19, 1970, fall joint computer conference on - AFIPS '70 (Fall)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1478462.1478481","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047267065","display_name":"K. S. Day","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kenton S. Day","raw_affiliation_strings":["ESL Incorporated, Sunnyvale, California","ESL, Inc., Sunnyvale, California"],"affiliations":[{"raw_affiliation_string":"ESL Incorporated, Sunnyvale, California","institution_ids":[]},{"raw_affiliation_string":"ESL, Inc., Sunnyvale, California","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5047267065"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.14162844,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"129","last_page":"129"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.979200005531311,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6951426267623901},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6844477653503418},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.6404946446418762},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.4376066327095032},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43297046422958374}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6951426267623901},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6844477653503418},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.6404946446418762},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.4376066327095032},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43297046422958374},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1478462.1478481","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1478462.1478481","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1478462.1478481","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the November 17-19, 1970, fall joint computer conference on - AFIPS '70 (Fall)","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/1478462.1478481","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1478462.1478481","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1478462.1478481","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the November 17-19, 1970, fall joint computer conference on - AFIPS '70 (Fall)","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2008999033.pdf","grobid_xml":"https://content.openalex.org/works/W2008999033.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W616545480","https://openalex.org/W1996647346","https://openalex.org/W2008175135","https://openalex.org/W2037090034","https://openalex.org/W2038471679","https://openalex.org/W2042569149","https://openalex.org/W2045135163"],"related_works":["https://openalex.org/W2077561982","https://openalex.org/W2393888177","https://openalex.org/W2544423928","https://openalex.org/W2967268719","https://openalex.org/W2115794623","https://openalex.org/W3115392711","https://openalex.org/W2360264381","https://openalex.org/W2067173559","https://openalex.org/W1613730747","https://openalex.org/W2541389358"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"a":[3,29],"variation":[4],"to":[5,16],"the":[6,45,53],"steepest-descent":[7,14],"method":[8],"for":[9,26,66],"generating":[10],"optimum":[11],"trajectories.":[12],"The":[13,35],"approach":[15],"trajectory":[17],"optimization":[18],"was":[19,61],"formulated":[20],"by":[21],"Kelley,":[22],"Bryson":[23],"et":[24],"al.,":[25],"numerically":[27],"solving":[28],"variety":[30],"of":[31,44,52],"two-point":[32],"boundary-value":[33],"problems.":[34],"procedure":[36],"is":[37],"iterative,":[38],"requiring":[39],"repeated":[40],"forward":[41],"numerical":[42],"integrations":[43,51],"state":[46],"differential":[47],"equations":[48],"and":[49],"backward":[50],"adjoint":[54],"equations.":[55],"In":[56],"many":[57],"applications,":[58],"however,":[59],"convergence":[60,68],"slow;":[62],"thus,":[63],"several":[64],"techniques":[65],"speeding":[67],"were":[69],"devised.":[70]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}