See kinodynamic in All languages combined, or Wiktionary
{ "etymology_text": "Coined in a 1993 Journal of the ACM paper (40(5): 1048-1066) by Bruce Donald, Pat Xavier, John Canny, and John Reif. Presumably from kinematic and dynamic.", "head_templates": [ { "args": { "1": "-" }, "expansion": "kinodynamic (not comparable)", "name": "en-adj" } ], "lang": "English", "lang_code": "en", "pos": "adj", "senses": [ { "categories": [ { "kind": "other", "name": "English entries with incorrect language header", "parents": [ "Entries with incorrect language header", "Entry maintenance" ], "source": "w" }, { "kind": "other", "name": "Pages with 1 entry", "parents": [], "source": "w" }, { "kind": "other", "name": "Pages with entries", "parents": [], "source": "w" } ], "examples": [ { "ref": "1993, Bruce R. Donald, Pat Xavier, John Canny, John Reif, “Kinodynamic Motion Planning”, in Journal of the ACM, volume 40, number 5, →DOI, pages 1048–1066:", "text": "Kinodynamic planning attempts to solve a robot motion problem subject to simultaneous kinematic and dynamics constraints. In the general problem, given a robot system, we must find a minimal-time trajectory that goes from a start position and velocity to a goal position and velocity. While exact solutions to this problem are not known, we provide the first provably-good approximation algorithm. and show that it runs in polynomial time.", "type": "quote" }, { "ref": "2016, Oktay Arslan, Karl Berntorp, Panagiotis Tsiotras, “Sampling-based Algorithms for Optimal Motion Planning Using Closed-loop Prediction”, in arXiv:", "text": "Currently, state-of-the-art methods evolve around kinodynamic variants of popular sampling-based algorithms, such as Rapidly-exploring Random Trees (RRTs).", "type": "quote" } ], "glosses": [ "Of or relating to a class of problems, in robotics and motion planning, for which velocity, acceleration, and force/torque bounds must be satisfied, together with kinematic constraints such as avoiding obstacles." ], "id": "en-kinodynamic-en-adj-R7fqzCue", "links": [ [ "robotics", "robotics" ], [ "motion", "motion" ], [ "planning", "planning" ], [ "velocity", "velocity" ], [ "acceleration", "acceleration" ], [ "force", "force" ], [ "torque", "torque" ], [ "satisfied", "satisfy" ], [ "kinematic", "kinematic" ], [ "constraint", "constraint" ], [ "avoid", "avoid" ], [ "obstacle", "obstacle" ] ], "related": [ { "word": "kinodynamically" }, { "word": "kinodynamics" } ], "tags": [ "not-comparable" ], "wikipedia": [ "Kinodynamic planning" ] } ], "word": "kinodynamic" }
{ "etymology_text": "Coined in a 1993 Journal of the ACM paper (40(5): 1048-1066) by Bruce Donald, Pat Xavier, John Canny, and John Reif. Presumably from kinematic and dynamic.", "head_templates": [ { "args": { "1": "-" }, "expansion": "kinodynamic (not comparable)", "name": "en-adj" } ], "lang": "English", "lang_code": "en", "pos": "adj", "related": [ { "word": "kinodynamically" }, { "word": "kinodynamics" } ], "senses": [ { "categories": [ "English adjectives", "English entries with incorrect language header", "English lemmas", "English terms with quotations", "English uncomparable adjectives", "Pages with 1 entry", "Pages with entries" ], "examples": [ { "ref": "1993, Bruce R. Donald, Pat Xavier, John Canny, John Reif, “Kinodynamic Motion Planning”, in Journal of the ACM, volume 40, number 5, →DOI, pages 1048–1066:", "text": "Kinodynamic planning attempts to solve a robot motion problem subject to simultaneous kinematic and dynamics constraints. In the general problem, given a robot system, we must find a minimal-time trajectory that goes from a start position and velocity to a goal position and velocity. While exact solutions to this problem are not known, we provide the first provably-good approximation algorithm. and show that it runs in polynomial time.", "type": "quote" }, { "ref": "2016, Oktay Arslan, Karl Berntorp, Panagiotis Tsiotras, “Sampling-based Algorithms for Optimal Motion Planning Using Closed-loop Prediction”, in arXiv:", "text": "Currently, state-of-the-art methods evolve around kinodynamic variants of popular sampling-based algorithms, such as Rapidly-exploring Random Trees (RRTs).", "type": "quote" } ], "glosses": [ "Of or relating to a class of problems, in robotics and motion planning, for which velocity, acceleration, and force/torque bounds must be satisfied, together with kinematic constraints such as avoiding obstacles." ], "links": [ [ "robotics", "robotics" ], [ "motion", "motion" ], [ "planning", "planning" ], [ "velocity", "velocity" ], [ "acceleration", "acceleration" ], [ "force", "force" ], [ "torque", "torque" ], [ "satisfied", "satisfy" ], [ "kinematic", "kinematic" ], [ "constraint", "constraint" ], [ "avoid", "avoid" ], [ "obstacle", "obstacle" ] ], "tags": [ "not-comparable" ], "wikipedia": [ "Kinodynamic planning" ] } ], "word": "kinodynamic" }
Download raw JSONL data for kinodynamic meaning in English (2.2kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.