{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000339805,0.0008932269,0.001054782,0.0006265545,0.0005179205,0.001267063,0.00147663,0.00139492,0.005887785],"category_scores_gemma":[0.001494144,0.0003741768,0.0006252317,0.001322325,0.000644506,0.001823074,0.001129647,0.001526068,0.001585718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004479237,"about_ca_system_score_gemma":0.001228735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002603453,"about_ca_topic_score_gemma":0.003266111,"domain_scores_codex":[0.9996694,0.0000562381,0.00001090259,0.00005120489,0.0001815712,0.00003067268],"domain_scores_gemma":[0.9997448,0.00011364,0.00002270927,0.00003041904,0.00006520786,0.00002319165],"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.0001582445,0.00009727773,0.0002886745,0.0002994177,0.00006509701,0.0001223537,0.0000951195,0.3991799,0.006473822,0.08917618,0.02572742,0.4783165],"study_design_scores_gemma":[0.00004744627,0.00005802139,0.0001345116,0.00002874819,0.00002123894,0.0001580306,0.0000222544,0.9243533,0.002380388,0.04232238,0.03045084,0.00002282882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004339217,0.001142317,0.9780737,0.0002535783,0.0002093076,0.00005955659,0.0001002481,0.0007352893,0.01508688],"genre_scores_gemma":[0.1108374,0.001883004,0.8598011,0.0001278724,0.0001595521,0.0001549728,0.0003324736,0.0006402707,0.02606328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005887785,"threshold_uncertainty_score":0.01969659,"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."}}