{"id":"W2025873700","doi":"10.1115/detc2002/dac-34105","title":"Using Genetic Algorithms With Niche Formation to Solve the Minimum Distance Problem Among Concave Objects","year":2002,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; University of New Brunswick","funders":"","keywords":"Maxima and minima; Mathematical optimization; Algorithm; Optimization problem; Regular polygon; Genetic algorithm; Set (abstract data type); Point (geometry); Computer science; Computational geometry; Mathematics; Geometry","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.0002227457,0.0002156938,0.0001812124,0.00007723115,0.0002813718,0.0003106183,0.0008615563,0.00005769652,0.00001105247],"category_scores_gemma":[0.00002846964,0.0001362672,0.00003514629,0.0007894555,0.00008250722,0.0006270232,0.0001763716,0.0001597874,0.00007462445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001019277,"about_ca_system_score_gemma":0.00003777021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005911492,"about_ca_topic_score_gemma":0.00002164981,"domain_scores_codex":[0.998247,0.00005496822,0.0002988875,0.0004275762,0.0004812848,0.0004903256],"domain_scores_gemma":[0.9987474,0.0001139567,0.0001485929,0.000684454,0.0001538443,0.0001517644],"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.00003483894,0.0004420455,0.008582345,0.0001935917,0.0002450693,0.000581233,0.09193185,0.724925,0.002218601,0.007716513,0.01727601,0.1458529],"study_design_scores_gemma":[0.0002978752,0.000139211,0.002485399,0.00006753889,0.00001166589,0.0001046452,0.0002337618,0.9952887,0.0008001864,0.000159206,0.0001565525,0.0002552073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007610684,0.0001093962,0.986991,0.0005425301,0.0001669706,0.0005995775,0.000001620517,0.0001983748,0.003779802],"genre_scores_gemma":[0.1998899,0.000003123776,0.7990528,0.000471214,0.0000651774,0.00003684705,9.4808e-7,0.00001460642,0.0004653973],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2703637,"threshold_uncertainty_score":0.5556816,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03937237066759954,"score_gpt":0.2457192473787921,"score_spread":0.2063468767111926,"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."}}