{"id":"W7014163805","doi":"","title":"Optimaal padvolgen voor robots snelle oplossingsmethoden voor praktische niet-convexe toepassingen","year":2015,"lang":"en","type":"article","venue":"Lirias (KU Leuven)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Canadian Institute for Advanced Research","keywords":"Motion planning; Path (computing); Robot; Convexity; Collision avoidance; Convex optimization; Optimization problem; Regular polygon","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001980832,0.0005973026,0.0007372806,0.0002803413,0.000369598,0.0008278759,0.002531246,0.0003809101,0.00003420122],"category_scores_gemma":[0.0007719856,0.0005699452,0.0002232616,0.0009545931,0.0001993897,0.001585216,0.001027443,0.0006436178,0.001280119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003124293,"about_ca_system_score_gemma":0.0008419186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002306618,"about_ca_topic_score_gemma":0.000004807281,"domain_scores_codex":[0.9950215,0.0005543813,0.0007652289,0.001309183,0.001158883,0.00119086],"domain_scores_gemma":[0.9962972,0.0003664099,0.000418306,0.001749479,0.0003447465,0.0008238168],"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.0003536775,0.001831989,0.009224524,0.0002949044,0.001223826,0.00373702,0.04583992,0.2320482,0.006903482,0.01855328,0.3308981,0.349091],"study_design_scores_gemma":[0.003425947,0.000726684,0.004118238,0.0002742356,0.0001348594,0.0005314054,0.0004042484,0.9231594,0.00436802,0.006906266,0.05395631,0.00199439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01043788,0.001057153,0.965679,0.005507282,0.004387468,0.0005753692,0.00001519745,0.001129528,0.01121108],"genre_scores_gemma":[0.03523044,0.000007295314,0.9558826,0.001104463,0.001031116,0.00007006982,0.00002335328,0.00009239933,0.00655827],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6911111,"threshold_uncertainty_score":0.9996752,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08760100654053746,"score_gpt":0.2904779816983541,"score_spread":0.2028769751578166,"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."}}