{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001607355,0.002061292,0.001257494,0.0007076774,0.0006008175,0.002373607,0.00141913,0.001591149,0.009159058],"category_scores_gemma":[0.004248753,0.0009735934,0.001426064,0.000780276,0.001463256,0.001533084,0.002464464,0.002876408,0.002548234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001319328,"about_ca_system_score_gemma":0.001954953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007288408,"about_ca_topic_score_gemma":0.006585131,"domain_scores_codex":[0.9989418,0.0003107461,0.00005852727,0.0002292482,0.0003389213,0.000120759],"domain_scores_gemma":[0.9983981,0.001112493,0.0000865421,0.0001338626,0.000222691,0.00004631324],"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.00006913343,0.00005803281,0.000341497,0.0004756578,0.00007459921,0.00009531926,0.0001356425,0.8347057,0.003097608,0.04348999,0.003785933,0.1136709],"study_design_scores_gemma":[0.00001411929,0.00002635892,0.0001043896,0.00005223887,0.00001400741,0.00003336554,0.00002804346,0.9753553,0.001168007,0.01777663,0.00541646,0.00001098961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002516558,0.0006143359,0.9911637,0.0002518994,0.00006990459,0.00006146097,0.00006162132,0.000191072,0.005069287],"genre_scores_gemma":[0.1528296,0.003108534,0.8186502,0.0002522459,0.0002001481,0.0007479839,0.0007800528,0.0008879665,0.02254319],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009159058,"threshold_uncertainty_score":0.03064013,"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."}}