{"id":"https://openalex.org/W2111445588","doi":"https://doi.org/10.1109/itcc.2002.1000444","title":"Cost-effective planning of timed mobile agents","display_name":"Cost-effective planning of timed mobile agents","publication_year":2005,"publication_date":"2005-08-24","ids":{"openalex":"https://openalex.org/W2111445588","doi":"https://doi.org/10.1109/itcc.2002.1000444","mag":"2111445588"},"language":"en","primary_location":{"id":"doi:10.1109/itcc.2002.1000444","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itcc.2002.1000444","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Conference on Information Technology: Coding and Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076251021","display_name":"Jin-Wook Baek","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Jin-Wook Baek","raw_affiliation_strings":["School of Computer Science and Engineering, Seoul National University, Seoul, South Korea","Sch. of Comput. Sci. & Eng., Seoul Nat. Univ., South Korea"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"Sch. of Comput. Sci. & Eng., Seoul Nat. Univ., South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026745511","display_name":"Gyutae Kim","orcid":"https://orcid.org/0000-0001-6747-8189"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Gyu-Tae Kim","raw_affiliation_strings":["School of Computer Science and Engineering, Seoul National University, Seoul, South Korea","Sch. of Comput. Sci. & Eng., Seoul Nat. Univ., South Korea"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"Sch. of Comput. Sci. & Eng., Seoul Nat. Univ., South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086519205","display_name":"Heon Y. Yeom","orcid":"https://orcid.org/0000-0001-6865-1756"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Heon-Young Yeom","raw_affiliation_strings":["School of Computer Science and Engineering, Seoul National University, Seoul, South Korea","Sch. of Comput. Sci. & Eng., Seoul Nat. Univ., South Korea"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"Sch. of Comput. Sci. & Eng., Seoul Nat. Univ., South Korea","institution_ids":["https://openalex.org/I139264467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5076251021"],"corresponding_institution_ids":["https://openalex.org/I139264467"],"apc_list":null,"apc_paid":null,"fwci":1.0949,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.82339748,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"536","last_page":"541"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8258593678474426},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6001808047294617},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.5473268032073975},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4535951018333435},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4515482783317566},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.44866758584976196},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4197123050689697},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.17601516842842102}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8258593678474426},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6001808047294617},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.5473268032073975},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4535951018333435},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4515482783317566},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44866758584976196},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4197123050689697},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.17601516842842102},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/itcc.2002.1000444","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itcc.2002.1000444","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Conference on Information Technology: Coding and Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.9389","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.9389","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dcslab.snu.ac.kr/paper/cost.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W11211593","https://openalex.org/W177402648","https://openalex.org/W1495557724","https://openalex.org/W1504328166","https://openalex.org/W1525389557","https://openalex.org/W1536442028","https://openalex.org/W1554451661","https://openalex.org/W1638045918","https://openalex.org/W2011039300","https://openalex.org/W2062344985","https://openalex.org/W2090779745","https://openalex.org/W2102678904","https://openalex.org/W2156036436","https://openalex.org/W2613768318","https://openalex.org/W6607299904","https://openalex.org/W6630052933","https://openalex.org/W6632331799","https://openalex.org/W6665814620"],"related_works":["https://openalex.org/W2315570462","https://openalex.org/W4294364856","https://openalex.org/W2299552569","https://openalex.org/W2164522043","https://openalex.org/W4383216082","https://openalex.org/W4361796174","https://openalex.org/W2529017546","https://openalex.org/W4311946102","https://openalex.org/W2964287305","https://openalex.org/W4385750195"],"abstract_inverted_index":{"The":[0,142],"two":[1,22,46],"most":[2],"significant":[3],"planning":[4,9,23],"factors":[5,24,30],"in":[6],"mobile":[7],"agent":[8,85,132],"(MAP)":[10],"are":[11,172],"the":[12,38,48,54,57,61,71,122,129,146,152,166,176],"number":[13,124],"of":[14,37,56,111,125],"agents":[15,126],"used":[16],"and":[17,91,128,158],"each":[18],"agent's":[19],"itinerary.":[20],"These":[21],"must":[25],"be":[26,67,156],"well-scheduled,":[27],"since":[28],"badly-scheduled":[29],"can":[31],"cause":[32],"longer":[33],"execution":[34],"times":[35],"because":[36],"higher":[39],"routing":[40,160],"costs.":[41],"In":[42],"addition":[43],"to":[44,66,88,155,175],"these":[45,109],"factors,":[47],"time":[49,81,147,154],"constraints":[50,148],"that":[51,73,165,171],"reside":[52],"on":[53],"nodes":[55,72],"information":[58,62,76,90,112,136,179],"repository":[59],"(i.e.":[60],"servers)":[63],"also":[64],"have":[65],"dealt":[68],"with.":[69],"Consider":[70],"present":[74],"correct":[75],"only":[77],"for":[78,134],"a":[79,95,116,138],"certain":[80],"interval.":[82],"If":[83],"an":[84],"is":[86],"sent":[87],"gather":[89],"arrives":[92],"earlier":[93],"than":[94],"specified":[96],"update":[97],"time,":[98],"it":[99],"may":[100],"retrieve":[101],"useless":[102],"or":[103],"corrupted":[104],"information.":[105],"To":[106],"cope":[107],"with":[108],"types":[110],"retrieval,":[113],"we":[114],"propose":[115],"time-constrained":[117,177],"MAP":[118],"method":[119,143,168],"which":[120],"finds":[121],"minimum":[123],"needed":[127],"best":[130],"scheduled":[131],"itineraries":[133],"retrieving":[135],"from":[137],"distributed":[139,178],"computing":[140],"environment.":[141],"works":[144],"under":[145],"mentioned":[149],"above,":[150],"allows":[151],"completion":[153],"lower-bounded":[157],"minimizes":[159],"overheads.":[161],"Simulation":[162],"results":[163,170],"show":[164],"proposed":[167],"produces":[169],"highly":[173],"applicable":[174],"retrieval":[180],"problem":[181],"domain.":[182]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}