{"id":"W3185337306","doi":"10.22215/etd/2021-14519","title":"Search and Rendezvous by Mobile Robots in Continuous Domains","year":2021,"lang":"en","type":"dissertation","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Rendezvous; Domain (mathematical analysis); Task (project management); Mobile robot; Function (biology); Robot; Position (finance); Computer science; Combinatorics; Discrete mathematics; Mathematics; Mathematical optimization; Artificial intelligence; Engineering; Mathematical analysis","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":[],"consensus_categories":[],"category_scores_codex":[0.0002732137,0.0001628764,0.0002598492,0.0001780112,0.00006875881,0.0003537837,0.0004061307,0.0001880744,0.0001488353],"category_scores_gemma":[0.00002296229,0.0001578756,0.00003571055,0.0004353434,0.00001975316,0.0002134514,0.0001133968,0.0003193543,0.00001702644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003907952,"about_ca_system_score_gemma":0.0001801681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002862471,"about_ca_topic_score_gemma":0.0008327397,"domain_scores_codex":[0.9984421,0.0001225149,0.0002547205,0.0005280752,0.0003506003,0.000302064],"domain_scores_gemma":[0.9993041,0.00006291344,0.00004007059,0.0003310445,0.000144666,0.0001172301],"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.00009039622,0.001595796,0.002649877,0.001210898,0.0002103582,0.0009904903,0.04107208,0.02025578,0.009759937,0.07253978,0.068607,0.7810176],"study_design_scores_gemma":[0.01080143,0.001995041,0.009246098,0.001670565,0.00005159494,0.0002096941,0.02482273,0.8496311,0.03999429,0.003721474,0.05179214,0.006063873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.2214393,0.01485729,0.4147795,0.00167435,0.002357601,0.004720433,0.00005311676,0.001023611,0.3390947],"genre_scores_gemma":[0.2238049,0.006663142,0.1194049,0.0009781648,0.00010537,0.0005785628,0.003135455,0.000126299,0.6452033],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.8293753,"threshold_uncertainty_score":0.6437981,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01041545859790946,"score_gpt":0.2812024195451884,"score_spread":0.2707869609472789,"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."}}