{"id":"W2138156761","doi":"10.1109/ramech.2004.1438015","title":"A robot path planning approach based on generalized semi-infinite optimization","year":2005,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Intersection (aeronautics); Motion planning; Obstacle avoidance; Mathematical optimization; Obstacle; Computer science; Path (computing); Transformation (genetics); Robot; Optimization problem; Representation (politics); Robotics; Artificial intelligence; Mathematics; Mobile robot; Engineering","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003928751,0.0002218983,0.0002114849,0.0002039475,0.0001521875,0.0002031078,0.0006741867,0.0001009811,0.00002907768],"category_scores_gemma":[0.00006588813,0.0001945018,0.00006637457,0.0004738232,0.00002003232,0.0003669442,0.00009121456,0.0001764493,0.00006681026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007468451,"about_ca_system_score_gemma":0.00007986344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001077204,"about_ca_topic_score_gemma":4.450445e-8,"domain_scores_codex":[0.9982134,0.0001042364,0.0002955075,0.0005473564,0.0004442474,0.0003952622],"domain_scores_gemma":[0.9988993,0.0001037214,0.0001099799,0.0006635561,0.00008044913,0.0001429317],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005815031,0.00008269771,0.0001174115,0.00000446397,0.000006215031,0.00001095983,0.0002167067,0.9929522,0.0000478154,0.001046204,0.001997827,0.003511705],"study_design_scores_gemma":[0.0007260119,0.00006991981,0.0002474475,0.0000311213,0.00000468671,0.00001256304,0.000009826002,0.9977044,0.0002622817,0.00001847496,0.0006520133,0.0002612364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001284998,0.0000309234,0.9769448,0.0008231818,0.0001679122,0.0001768248,0.000001491853,0.0006149846,0.02111135],"genre_scores_gemma":[0.02366696,0.000001400509,0.9723303,0.003106193,0.00016281,0.00002676048,0.0000318536,0.00001847973,0.0006552104],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02353846,"threshold_uncertainty_score":0.7931554,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0286783069306427,"score_gpt":0.2565187547912222,"score_spread":0.2278404478605795,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}