{"id":"W1488040414","doi":"10.1007/978-3-642-13059-5_20","title":"The Ant Search Algorithm: An Ant Colony Optimization Algorithm for the Optimal Searcher Path Problem with Visibility","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Defence Research and Development Canada; Université Laval","funders":"","keywords":"Ant colony optimization algorithms; Visibility; Computer science; Path (computing); Solver; Mathematical optimization; Algorithm; Integer programming; Search algorithm; Object (grammar); Motion planning; Artificial intelligence; Mathematics; Robot","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":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":["sts"],"category_scores_codex":[0.008281467,0.0007614828,0.0006360727,0.0005295425,0.002280093,0.003075215,0.007483331,0.0004725783,0.0000515452],"category_scores_gemma":[0.0003194337,0.000433836,0.0001630273,0.001389988,0.002963846,0.0009963241,0.002005495,0.002365087,0.00001304307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000474107,"about_ca_system_score_gemma":0.002934292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008374401,"about_ca_topic_score_gemma":0.00008887864,"domain_scores_codex":[0.9916563,0.0003081082,0.0008436082,0.002493386,0.003145111,0.001553494],"domain_scores_gemma":[0.9900433,0.003452983,0.0003829951,0.003256168,0.002401561,0.0004629907],"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.0000165101,0.00006102714,0.000003274432,0.00001785751,0.00002461346,0.00002236244,0.0004164772,0.3489656,0.000009759538,0.001302617,0.00001089742,0.649149],"study_design_scores_gemma":[0.0005856905,0.000840485,0.00002576289,0.00008759455,0.00001748631,0.00009071449,0.000002316896,0.9904588,0.000370514,0.005372281,0.001556122,0.0005921635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000004327022,0.0002936219,0.9928042,0.002109285,0.0009394141,0.003405219,0.00005432023,0.0001703806,0.0002192773],"genre_scores_gemma":[0.000206154,0.0001995112,0.997603,0.0003411488,0.0006430206,0.000177668,0.00003160943,0.00008499665,0.0007129132],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6485568,"threshold_uncertainty_score":0.9999365,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02427545259411336,"score_gpt":0.2929841638886309,"score_spread":0.2687087112945175,"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."}}