{"id":"W4243557204","doi":"10.22215/etd/2014-10209","title":"Motion Planning with Directional Constraints","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Piecewise linear function; Path (computing); Polygon (computer graphics); Motion planning; Constraint (computer-aided design); Piecewise; Mathematical optimization; Motion (physics); Computer science; Algorithm; Mathematics; Robot; Geometry; Artificial intelligence; Mathematical analysis; Telecommunications","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.0002004991,0.000239029,0.0002369637,0.000187107,0.0001327791,0.0001577332,0.0004790084,0.000185936,0.00004407779],"category_scores_gemma":[0.00003518522,0.0001973943,0.00004518701,0.0002079653,0.00003402426,0.0002064496,0.0000205251,0.0002877631,0.0001115461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004432732,"about_ca_system_score_gemma":0.0001368657,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001962115,"about_ca_topic_score_gemma":0.000004204565,"domain_scores_codex":[0.9985171,0.00004712803,0.0002082268,0.0005152129,0.000463838,0.0002484767],"domain_scores_gemma":[0.999147,0.00009608499,0.0001902675,0.0003419517,0.0001360571,0.00008863396],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001516738,0.0003998015,0.009145039,0.0006260779,0.0007787957,0.0006758209,0.008439275,0.06567198,0.0008072177,0.1095616,0.02450286,0.7792399],"study_design_scores_gemma":[0.003120251,0.001043222,0.2213929,0.003473975,0.0001914689,0.001098914,0.001112853,0.7451923,0.007292702,0.005295199,0.006213093,0.004573111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000936813,0.00003123865,0.8757148,0.0000427514,0.001274262,0.000116264,0.000001623733,0.0004067252,0.1214755],"genre_scores_gemma":[0.1141936,0.000002181857,0.8555154,0.0002001999,0.0004015896,0.00005380297,0.0007381216,0.00005023992,0.02884485],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7746668,"threshold_uncertainty_score":0.8049508,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01429462787922802,"score_gpt":0.2589275249449518,"score_spread":0.2446328970657238,"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."}}