Prof. Xiaomeng Ye Profile

Prof. Xiaomeng Ye

at Hefei No.8 Senior High School

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 13 October 2022 Paper

Basic search algorithms in Python

Xiaomeng Ye

Proceedings Volume 12287, 1228704 (2022) https://doi.org/10.1117/12.2640473

KEYWORDS: Evolutionary algorithms, Associative arrays, Computer simulations, Algorithms, Visualization, Mathematics, Analytical research, Time metrology, Object oriented programming, Logic

Read Abstract +

The research is mainly about the Python implementation of three basic algorithms: Depth-First Search, Breadth-First Search and A* Search. Besides, the paper introduces some of the auxiliary knowledge and theories: the four criteria for measuring algorithms, three kinds of queues, and grid-based simulation. While other coding languages like C++ and Java may focus on algorithm more and may have lots of templates and other solved works, Python seem not to focus so much on this, and OOP (object-oriented programming) is the major topic of high-level Python coding. Thus, constructing algorithms and mapping (or simulating real-world situations) indeed become a challenge.In this work, two simulations are made by generating classes: 1. grid-based world 2. graph and vertex. Grid based world introduces coordinates and heuristic functions, which constructs the environment suitable for greedy algorithms. Graph and vertex use nodes to represent different states in the of the world, and using frontier-based search, the nodes will be explored step by step from the initial state until the goal state is reached. After the environment and algorithms are constructed, finally, analysis for the three algorithms are presented in the conclusion part according to the criteria mentioned.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years