Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2409.02549

Help | Advanced Search

Computer Science > Artificial Intelligence

arXiv:2409.02549 (cs)
[Submitted on 4 Sep 2024 (v1) , last revised 5 Sep 2024 (this version, v2)]

Title: A Sequential Decision-Making Model for Perimeter Identification

Title: 一种用于边界识别的序贯决策模型

Authors:Ayal Taitler
Abstract: Perimeter identification involves ascertaining the boundaries of a designated area or zone, requiring traffic flow monitoring, control, or optimization. Various methodologies and technologies exist for accurately defining these perimeters; however, they often necessitate specialized equipment, precise mapping, or comprehensive data for effective problem delineation. In this study, we propose a sequential decision-making framework for perimeter search, designed to operate efficiently in real-time and require only publicly accessible information. We conceptualize the perimeter search as a game between a playing agent and an artificial environment, where the agent's objective is to identify the optimal perimeter by sequentially improving the current perimeter. We detail the model for the game and discuss its adaptability in determining the definition of an optimal perimeter. Ultimately, we showcase the model's efficacy through a real-world scenario, highlighting the identification of corresponding optimal perimeters.
Abstract: 边界识别涉及确定指定区域或区界的边界,需要对交通流量进行监控、控制或优化。 存在多种方法和技术可以准确界定这些边界;然而,它们通常需要专门的设备、精确的地图绘制或全面的数据来有效解决问题。 在本研究中,我们提出了一种用于边界搜索的顺序决策框架,旨在实时高效运行,并仅需公开可获取的信息。 我们将边界搜索概念化为一个玩家代理与人工环境之间的博弈,其中代理的目标是通过逐步改进当前边界来识别最优边界。 我们详细描述了游戏模型,并讨论了其在确定最优边界定义方面的适应性。 最终,我们通过一个现实世界的情景展示了该模型的有效性,重点突出了对应最优边界的识别。
Subjects: Artificial Intelligence (cs.AI)
Cite as: arXiv:2409.02549 [cs.AI]
  (or arXiv:2409.02549v2 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.2409.02549
arXiv-issued DOI via DataCite

Submission history

From: Ayal Taitler [view email]
[v1] Wed, 4 Sep 2024 09:11:39 UTC (1,258 KB)
[v2] Thu, 5 Sep 2024 06:58:38 UTC (1,258 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.AI
< prev   |   next >
new | recent | 2024-09
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号