{"id":"https://openalex.org/W2099588080","doi":"https://doi.org/10.1109/rttas.2004.1317279","title":"A real-time model for the robotic highway safety marker system","display_name":"A real-time model for the robotic highway safety marker system","publication_year":2004,"publication_date":"2004-11-13","ids":{"openalex":"https://openalex.org/W2099588080","doi":"https://doi.org/10.1109/rttas.2004.1317279","mag":"2099588080"},"language":"en","primary_location":{"id":"doi:10.1109/rttas.2004.1317279","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rttas.2004.1317279","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","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/A5100841037","display_name":"Jiazheng Shi","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jiazheng Shi","raw_affiliation_strings":["Computer Science & Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science & Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110433428","display_name":"Steve Goddard","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Goddard","raw_affiliation_strings":["Computer Science & Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA","Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science & Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111370702","display_name":"Anagh Lal","orcid":null},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Lal","raw_affiliation_strings":["Computer Science & Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA","Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science & Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"Dept. of Comput. Sci. & Eng., Nebraska Univ., Lincoln, NE, USA","institution_ids":["https://openalex.org/I114395901"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034898179","display_name":"Shane Farritor","orcid":"https://orcid.org/0000-0003-3212-6591"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Farritor","raw_affiliation_strings":["Mechanical Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA","Mechanical & Materials Engineering"],"affiliations":[{"raw_affiliation_string":"Mechanical Engineering, University of Nebraska, Lincoln, Lincolnshire, NE, USA","institution_ids":["https://openalex.org/I114395901"]},{"raw_affiliation_string":"Mechanical & Materials Engineering","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100841037"],"corresponding_institution_ids":["https://openalex.org/I114395901"],"apc_list":null,"apc_paid":null,"fwci":1.8486,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.84581605,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"331","last_page":"340"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.9850000143051147,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9848999977111816,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.7511272430419922},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7294708490371704},{"id":"https://openalex.org/keywords/predictability","display_name":"Predictability","score":0.6491438746452332},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5515263080596924},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5028142333030701},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.47060924768447876},{"id":"https://openalex.org/keywords/real-time-operating-system","display_name":"Real-time operating system","score":0.46140187978744507},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.45133644342422485},{"id":"https://openalex.org/keywords/priority-inversion","display_name":"Priority inversion","score":0.4234091639518738},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.2465629279613495},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.170922189950943},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.13691136240959167},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.10955876111984253},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.10773459076881409},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10767555236816406}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7511272430419922},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7294708490371704},{"id":"https://openalex.org/C197640229","wikidata":"https://www.wikidata.org/wiki/Q2534066","display_name":"Predictability","level":2,"score":0.6491438746452332},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5515263080596924},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5028142333030701},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.47060924768447876},{"id":"https://openalex.org/C28472234","wikidata":"https://www.wikidata.org/wiki/Q213666","display_name":"Real-time operating system","level":2,"score":0.46140187978744507},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.45133644342422485},{"id":"https://openalex.org/C172828308","wikidata":"https://www.wikidata.org/wiki/Q520734","display_name":"Priority inversion","level":5,"score":0.4234091639518738},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.2465629279613495},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.170922189950943},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.13691136240959167},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.10955876111984253},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.10773459076881409},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10767555236816406},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/rttas.2004.1317279","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rttas.2004.1317279","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. RTAS 2004. 10th IEEE Real-Time and Embedded Technology and Applications Symposium, 2004.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.65.3945","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.65.3945","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.unl.edu/~goddard/Papers/Conference/rtas04-robot.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W93850807","https://openalex.org/W132231901","https://openalex.org/W780875323","https://openalex.org/W1485093219","https://openalex.org/W1911718429","https://openalex.org/W1975557016","https://openalex.org/W1999828800","https://openalex.org/W2064207294","https://openalex.org/W2095594661","https://openalex.org/W2095905764","https://openalex.org/W2097156868","https://openalex.org/W2097856935","https://openalex.org/W2100634809","https://openalex.org/W2103120971","https://openalex.org/W2105995702","https://openalex.org/W2109488193","https://openalex.org/W2111894160","https://openalex.org/W2125409550","https://openalex.org/W2163583908","https://openalex.org/W2166440675","https://openalex.org/W2169718733","https://openalex.org/W2226858871","https://openalex.org/W2262960161","https://openalex.org/W4230535538","https://openalex.org/W4239180414","https://openalex.org/W6605403152","https://openalex.org/W6622642062","https://openalex.org/W6674236625"],"related_works":["https://openalex.org/W4386738165","https://openalex.org/W2598368986","https://openalex.org/W2385139534","https://openalex.org/W2357346532","https://openalex.org/W2373399453","https://openalex.org/W2354477941","https://openalex.org/W2780329882","https://openalex.org/W4231754182","https://openalex.org/W2364408853","https://openalex.org/W2354069482"],"abstract_inverted_index":{"We":[0,48,116,208],"present":[1,177],"the":[2,11,22,31,51,72,77,155,168,173,182,186,205,216,222,227,247],"design":[3],"and":[4,28,41,53,60,76,97,129,226],"implementation":[5,212],"of":[6,14,33,39,135,188,218],"a":[7,57,178],"real-time":[8,121,170,202],"model":[9,75],"for":[10,157,181,215,235,250],"global":[12],"control":[13],"robotic":[15],"highway":[16],"safety":[17,159,220,251],"markers.":[18,252],"Problems":[19],"addressed":[20],"in":[21],"system":[23,52,142,203],"are:":[24],"1)":[25],"poor":[26],"scalability":[27,174],"predictability":[29],"as":[30],"number":[32,187],"markers":[34],"increases,":[35],"2)":[36],"jerky":[37],"movement":[38],"markers,":[40,221],"3)":[42],"false-hits":[43],"caused":[44],"by":[45,87],"environment":[46],"objects.":[47],"extensively":[49],"analyze":[50],"offer":[54],"two":[55,69,119],"solutions:":[56],"basic":[58,239],"solution":[59],"an":[61],"enhanced":[62],"solution.":[63],"They":[64],"are":[65,109],"built":[66],"respectively":[67],"upon":[68],"task":[70,74,81,217],"models:":[71],"periodic":[73],"variable":[78],"rate":[79,124],"execution":[80,95],"model.":[82],"The":[83,100,238],"former":[84],"is":[85,143,204,244],"characterized":[86],"four":[88],"static":[89],"parameters:":[90],"phase,":[91],"period,":[92],"worst":[93],"case":[94],"time":[96,223],"relative":[98],"deadline.":[99],"latter":[101],"has":[102],"similar":[103],"parameters.":[104],"Its":[105],"parameter":[106],"values,":[107],"however,":[108],"allowed":[110],"to":[111,164,245],"change":[112],"at":[113],"arbitrary":[114],"times.":[115],"then":[117],"examine":[118],"typical":[120],"scheduling":[122],"approaches:":[123],"monotonic":[125],"(RM)":[126],"priority":[127],"driven":[128],"earliest":[130],"deadline":[131],"first":[132],"(EDF).":[133],"Analysis":[134],"their":[136],"sufficient":[137,179],"conditions":[138],"shows":[139],"that":[140,154,191],"our":[141,201,242],"feasibly":[144],"schedulable":[145],"under":[146,167],"either":[147],"RM":[148],"or":[149],"EDF.":[150],"This":[151],"conclusion":[152],"justifies":[153],"path":[156],"each":[158],"marker":[160],"can":[161,192],"be":[162,165,193],"guaranteed":[163],"smooth":[166],"designed":[169],"system.":[171],"For":[172],"issue,":[175],"we":[176],"condition":[180],"upper":[183],"bound":[184],"on":[185],"barrel":[189],"robots":[190],"reliably":[194],"controlled.":[195],"One":[196],"key":[197],"technique":[198],"integrated":[199],"into":[200],"Hough":[206],"transform.":[207],"refine":[209],"its":[210],"traditional":[211],"so":[213],"that,":[214],"detecting":[219],"complexity":[224],"decreases":[225],"reliability":[228],"increases":[229],"with":[230],"only":[231],"slight":[232],"additional":[233],"storage":[234],"search":[236,248],"windows.":[237],"idea":[240],"behind":[241],"improvements":[243],"limit":[246],"window":[249]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}